19 search results - page 4 / 4 » Concurrent Non-Malleable Zero Knowledge Proofs |
129
Voted
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
139
Voted
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
119
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
136
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...