Witness-succinct universally-composable SNARKs
From MaRDI portal
Publication:6061363
DOI10.1007/978-3-031-30617-4_11OpenAlexW4365807461MaRDI QIDQ6061363
Yashvanth Kondi, Mahak Pancholi, Claudio Orlandi, Akira Takahashi, Daniel Tschudi, Chaya Ganesh
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30617-4_11
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of interactive proofs with bounded communication
- Updatable and universal common reference strings with applications to zk-SNARKs
- On interactive proofs with a laconic prover
- The wonderful world of global random oracles
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- The algebraic group model and its applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Recursive proof composition from accumulation schemes
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Composition with knowledge assumptions
- Another look at extraction and randomization of Groth's zk-SNARK
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Subversion-resistant simulation (knowledge) sound NIZKs
- Aurora: transparent succinct arguments for R1CS
- Strengthening zero-knowledge protocols using signatures
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
- On the Non-malleability of the Fiat-Shamir Transform
- Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
- Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Constant-Size Commitments to Polynomials and Their Applications
- Interactive Oracle Proofs
- Universally composable two-party and multi-party secure computation
- New and improved constructions of non-malleable cryptographic protocols
- Perfect Non-interactive Zero Knowledge for NP
- Universally Composable Security with Global Setup
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Noninteractive Zero-Knowledge
- Computationally Sound Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Advances in Cryptology - EUROCRYPT 2004
- New Techniques for Noninteractive Zero-Knowledge
- Advances in Cryptology - CRYPTO 2003
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Ligero: lightweight sublinear arguments without a trusted setup
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Algebraic adversaries in the universal composability framework
- Universally composable \(\varSigma \)-protocols in the global random-oracle model
This page was built for publication: Witness-succinct universally-composable SNARKs