Perfect zero-knowledge arguments for NP using any one-way permutation

DOI10.1007/s001459900037zbMath0960.94016OpenAlexW2049198367WikidataQ126298213 ScholiaQ126298213MaRDI QIDQ1126890

Ramarathnam Venkatesan, Moni Naor, Rafail Ostrovsky, Mordechai M. Yung

Publication date: 20 May 2001

Published in: Journal of Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

cryptographycomputer securityone-way permutationcryptographic primitiveinteractive protocolsperfect zero-knowledge arguments

Mathematics Subject Classification ID

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

Related Items

Concurrent knowledge extraction in public-key models ⋮ Quantum bit-commitment for small storage based on quantum one-way permutations ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Long-term security and universal composability ⋮ Super-Perfect Zero-Knowledge Proofs ⋮ Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Statistical security in two-party computation revisited ⋮ General properties of quantum bit commitments (extended abstract) ⋮ Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP ⋮ More efficient verifiable functional encryption ⋮ On the impossibility of non-static quantum bit commitment between two parties ⋮ A new interactive hashing theorem ⋮ Optimal Reductions Between Oblivious Transfers Using Interactive Hashing ⋮ Semi-honest to Malicious Oblivious Transfer—The Black-Box Way ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge ⋮ The Complexity of Zero Knowledge ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ Reducing complexity assumptions for statistically-hiding commitment ⋮ On the Power of Secure Two-Party Computation ⋮ Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction ⋮ Interactive Hashing: An Information Theoretic Tool (Invited Talk) ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing