Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Bit-commitment:
TR04-115 | 1st December 2004
Iftach Haitner, Ronen Shaltiel

Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions

A statistical zero knowledge argument for NP is a cryptographic primitive that allows a polynomial-time prover to convince another
polynomial-time verifier of the validity of an NP statement. It is guaranteed that even an infinitely powerful verifier does not learn any
additional information but the validity of the claim.

Naor ... more >>>

ISSN 1433-8092 | Imprint