Super-Perfect Zero-Knowledge Proofs

DOI10.1007/978-3-030-43662-9_8OpenAlexW2394661239MaRDI QIDQ5098773

Liav Teichner, Oded Goldreich

Publication date: 30 August 2022

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.588.260

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Related Items (2)

Generic plaintext equality and inequality proofs ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC)

Cites Work

• Unnamed Item
• BPP and the polynomial hierarchy
• Minimum disclosure proofs of knowledge
• Perfect zero-knowledge arguments for NP using any one-way permutation
• PRIMES is in P
• A complete problem for statistical zero knowledge
• Concurrent Nonmalleable Commitments
• Perfect Non-interactive Zero Knowledge for NP
• New and Improved Constructions of Nonmalleable Cryptographic Protocols
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• The Knowledge Complexity of Interactive Proof Systems
• Noninteractive Zero-Knowledge
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Foundations of Cryptography
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• Computational Complexity

This page was built for publication: Super-Perfect Zero-Knowledge Proofs