ABSTRACT
No abstract available.
Recommendations
Towards Non-interactive Witness Hiding
Theory of CryptographyAbstractWitness hiding proofs require that the verifier cannot find a witness after seeing a proof. The exact round complexity needed for witness hiding proofs has so far remained an open question. In this work, we provide compelling evidence that witness ...
Mutual witness proximity graphs
This paper describes one variation on witness proximity graphs called mutual witness proximity graphs. Two witness proximity graphs are said to be mutual when, given two sets of points A and B, A is the vertex set of the first graph and the witness set ...
Comments