Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Non-interactive witness-indistinguishability:
TR07-053 | 27th April 2007
Jens Groth, Amit Sahai

Efficient Non-interactive Proof Systems for Bilinear Groups

Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficiency has prevented them from being used in practice. One of the roots of this inefficiency is that non-interactive zero-knowledge proofs have been constructed for general NP-complete languages such as ... more >>>

TR17-005 | 10th January 2017
Nir Bitansky

Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs

Revisions: 3

Verifiable random functions (VRFs) are pseudorandom functions where the owner of the seed, in addition to computing the function's value $y$ at any point $x$, can also generate a non-interactive proof $\pi$ that $y$ is correct (relative to so), without compromising pseudorandomness at other points. Being a natural primitive with ... more >>>

ISSN 1433-8092 | Imprint