Zero-knowledge proofs of decision power: New protocols and optimal round- complexity

DOI10.1007/BFB0028458MaRDI QIDQ4373608zbMATH OpenFDO

Authors Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung

Publication date 11 June 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028458

zbMATH Keywords

perfect zero-knowledge proof systems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols
• The knowledge complexity of quadratic residuosity languages
• On zero-knowledge proofs (extended abstract)

Cited in

(11)

• The knowledge complexity of quadratic residuosity languages
• Promise zero knowledge and its applications to round optimal MPC
• Perfect zero knowledge: new upperbounds and relativized separations
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
• On zero-knowledge proofs (extended abstract)
• Direct Zero Knowledge Proofs of Computational Power in Five Rounds
• Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols
• Advances in Cryptology – CRYPTO 2004
• Which Languages Have 4-Round Zero-Knowledge Proofs?
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection

This page was built for publication: Zero-knowledge proofs of decision power: New protocols and optimal round- complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373608)