Non-interactive zero-knowledge proofs to multiple verifiers
From MaRDI portal
Publication:6135446
DOI10.1007/978-3-031-22969-5_18zbMath1519.94198OpenAlexW4320082969MaRDI QIDQ6135446
Publication date: 25 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22969-5_18
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- The price of low communication in secure multi-party computation
- Transparent SNARKs from DARK compilers
- Order-C secure multiparty computation for highly repetitive circuits
- The more the merrier: reducing the cost of large scale MPC
- Guaranteed output delivery comes free in honest majority MPC
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- ATLAS: efficient and scalable MPC in the honest majority setting
- Unconditional communication-efficient MPC via Hall's marriage theorem
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Aurora: transparent succinct arguments for R1CS
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Scalable zero knowledge with no trusted setup
- Secure multi-party computation without agreement
- Efficient fully secure computation via distributed zero-knowledge proofs
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Interactive Oracle Proofs
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Cryptography in the Multi-string Model
- Scalable and Unconditionally Secure Multiparty Computation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Broadcast Interactive Proofs
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fiat-Shamir: from practice to theory
- Circuits resilient to additive attacks with applications to secure computation
- Theory of Cryptography
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
This page was built for publication: Non-interactive zero-knowledge proofs to multiple verifiers
