Round-optimal fully black-box zero-knowledge arguments from one-way permutations

DOI10.1007/978-3-030-03807-6_10zbMath1443.94062OpenAlexW2794490409MaRDI QIDQ1629411

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

Publication date: 11 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_10

zbMATH Keywords

one-way permutationsblack-box constructionszero-knowledge arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Round-optimal black-box MPC in the plain model ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ Round-optimal black-box commit-and-prove with succinct communication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Which languages have 4-round zero-knowledge proofs?
• Bit commitment using pseudorandomness
• Definitions and properties of zero-knowledge proof systems
• On the existence of three round zero-knowledge proofs
• How to construct constant-round zero-knowledge proof systems for NP
• Improved OR-Composition of Sigma-Protocols
• On the Power of Secure Two-Party Computation
• On Efficient Zero-Knowledge PCPs
• Round-Optimal Black-Box Two-Party Computation
• Zero-Knowledge Proofs from Secure Multiparty Computation
• Universally composable two-party and multi-party secure computation
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• The Knowledge Complexity of Interactive Proof Systems
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• 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
• Multi-collision resistance: a paradigm for keyless hash functions

This page was built for publication: Round-optimal fully black-box zero-knowledge arguments from one-way permutations