We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Precise zero knowledge introduced by Micali and Pass (STOC'06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed t...
Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung D...
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge pro...
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...