Your reputation's safe with me: framing-free distributed zero-knowledge proofs
From MaRDI portal
Publication:6581782
DOI10.1007/978-3-031-48615-9_2zbMath1544.9425MaRDI QIDQ6581782
Muthuramakrishnan Venkitasubramaniam, Carmit Hazay, Mor Weiss
Publication date: 1 August 2024
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Cites Work
- Unnamed Item
- Unnamed Item
- Catching MPC cheaters: identification and openability
- Efficient constant-round MPC with identifiable abort and public verifiability
- The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
- Sublinear GMW-style compiler for MPC with preprocessing
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Efficient fully secure computation via distributed zero-knowledge proofs
- Secure Multi-Party Computation with Identifiable Abort
- Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
- Cheater Detection in SPDZ Multiparty Computation
- Efficient Secure Multiparty Computation with Identifiable Abort
- Cryptography in the Multi-string Model
- Broadcast Interactive Proofs
- The knowledge complexity of interactive proof-systems
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
- Scalable Secure Multiparty Computation
- Ligero: lightweight sublinear arguments without a trusted setup
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- On sufficient oracles for secure computation with identifiable abort
- Non-interactive zero-knowledge proofs to multiple verifiers
This page was built for publication: Your reputation's safe with me: framing-free distributed zero-knowledge proofs
