Zaps and Their Applications

DOI10.1137/S0097539703426817zbMath1125.94019MaRDI QIDQ5432360

Moni Naor, Cynthia Dwork

Publication date: 3 January 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

zero-knowledge; nonmalleable cryptosystems

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

03D15: Complexity of computation (including implicit computational complexity)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, (2+\(f\)(\(n\)))-SAT and its properties., Lower bounds for non-black-box zero knowledge, Limits of Constructive Security Proofs