Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?

DOI10.1007/978-3-030-45727-3_20OpenAlexW3023552842MaRDI QIDQ2055669

Muthuramakrishnan Venkitasubramaniam, Carmit Hazay, Rafael Pass

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_20

zbMATH Keywords

one-way functionsblack-box constructionszero-knowledge arguments

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of software (68Nxx)

Related Items

Round-optimal black-box MPC in the plain model

Cites Work

• Unnamed Item
• Unnamed Item
• Which languages have 4-round zero-knowledge proofs?
• Bit commitment using pseudorandomness
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Definitions and properties of zero-knowledge proof systems
• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Round optimal black-box ``commit-and-prove
• On the existence of three round zero-knowledge proofs
• On Efficient Zero-Knowledge PCPs
• The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
• Round-Optimal Black-Box Two-Party Computation
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• The Knowledge Complexity of Interactive Proof Systems
• A Pseudorandom Generator from any One-way Function
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• On the Composition of Zero-Knowledge Proof Systems
• Multi-collision resistance: a paradigm for keyless hash functions
• Theory of Cryptography