Sometimes you can't distribute random-oracle-based proofs

DOI10.1007/978-3-031-68388-6_12MaRDI QIDQ6652973FDOQ6652973

Authors: Jack Doerner, Yashvanth Kondi, Leah Namisa Rosenbloom 

Publication date: 13 December 2024

Recommendations

• Universally composable \(\varSigma \)-protocols in the global random-oracle model
• Zero-knowledge proofs from secure multiparty computation
• Limits on the Usefulness of Random Oracles
• On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
• MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)

zbMATH Keywords

zero-knowledge proofs of knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Security proofs for signature schemes
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• The knowledge complexity of interactive proof-systems
• Advances in Cryptology - CRYPTO 2003
• Title not available (Why is that?)
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Aurora: transparent succinct arguments for R1CS
• Non-interactive zero-knowledge proofs in the quantum random oracle model
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• On the size of pairing-based non-interactive arguments
• Interactive oracle proofs
• Transparent SNARKs from DARK compilers
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Triply adaptive UC NIZK
• MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
• Universally composable \(\varSigma \)-protocols in the global random-oracle model
• Minimizing trust in hardware wallets with two factor signatures
• Snarky ceremonies
• Improved straight-line extraction in the random oracle model with applications to signature aggregation
• Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head

Cited In (1)

• Security-preserving distributed samplers: how to generate any CRS in one round without random oracles

This page was built for publication: Sometimes you can't distribute random-oracle-based proofs

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