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

DOI10.1007/S001459900037MaRDI QIDQ1126890zbMATH OpenOpenAlexWikidataFDO

Authors Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti 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

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

Recommendations

• scientific article; zbMATH DE number 1559559
• Constant-round perfect zero-knowledge computationally convincing protocols
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• On the round complexity of zero-knowledge proofs based on one-way permutations

Cited in

(34)

• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Concurrent knowledge extraction in public-key models
• Computational hardness of optimal fair computation: beyond Minicrypt
• More efficient verifiable functional encryption
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• On the ring-LWE and polynomial-LWE problems
• Quantum bit-commitment for small storage based on quantum one-way permutations
• On the impossibility of non-static quantum bit commitment between two parties
• Optimal forgeries against polynomial-based MACs and GCM
• A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• The Complexity of Zero Knowledge
• Bit commitment in the bounded storage model: tight bound and simple optimal construction
• How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
• scientific article; zbMATH DE number 697825 (Why is no real title available?)
• scientific article; zbMATH DE number 708823 (Why is no real title available?)
• Long-term security and universal composability
• Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
• Reducing complexity assumptions for statistically-hiding commitment
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
• On the Power of Secure Two-Party Computation
• Efficient oblivious transfer from lossy threshold homomorphic encryption
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Magic functions
• Super-Perfect Zero-Knowledge Proofs
• Interactive Hashing: An Information Theoretic Tool (Invited Talk)
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
• scientific article; zbMATH DE number 708806 (Why is no real title available?)
• A new interactive hashing theorem
• 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)
• Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: Perfect zero-knowledge arguments for NP using any one-way permutation

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