On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs

DOI10.1007/978-3-319-44618-9_13zbMath1416.94048OpenAlexW2511425861MaRDI QIDQ2827722

Yi Deng, Huaxiong Wang, San Ling, Juan A. Garay, Mordechai M. Yung

Publication date: 21 October 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_13

Mathematics Subject Classification ID

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

Related Items (3)

Individual simulations ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Minimum disclosure proofs of knowledge
• Lower bounds for non-black-box zero knowledge
• On the Correlation Intractability of Obfuscated Pseudorandom Functions
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs
• Strict polynomial-time in simulation and extraction
• The Knowledge Complexity of Interactive Proof Systems
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• Why “Fiat-Shamir for Proofs” Lacks a Proof

This page was built for publication: On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs