Tight state-restoration soundness in the algebraic group model
From MaRDI portal
Publication:2128989
DOI10.1007/978-3-030-84252-9_3zbMATH Open1487.94116OpenAlexW3109521544MaRDI QIDQ2128989FDOQ2128989
Authors: Ashrujit Ghoshal, Stefano Tessaro 
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_3
Recommendations
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Short pairing-based non-interactive zero-knowledge arguments
- Co-sound Zero-Knowledge with Public Keys
zero-knowledge proof systemsconcrete securityFiat-Shamir transformalgebraic group modelstate-restoration soundness
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- An efficient parallel repetition theorem
- The knowledge complexity of interactive proof-systems
- Algebraic methods for interactive proof systems
- Parallel repetition theorems for interactive arguments
- A Parallel Repetition Theorem for Any Interactive Argument
- Cryptography and Coding
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- The algebraic group model and its applications
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Title not available (Why is that?)
- 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
- Fiat-Shamir: from practice to theory
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- Expected-time cryptography: generic techniques and applications to concrete soundness
Cited In (18)
- Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency
- Fiat-Shamir security of FRI and related SNARKs
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Fiat-Shamir transformation of multi-round interactive proofs
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
- Algebraic group model with oblivious sampling
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Spartan and bulletproofs are simulation-extractable (for free!)
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Revisiting BBS signatures
- A holistic security analysis of Monero transactions
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- On pairing-free blind signature schemes in the algebraic group model
- An analysis of the algebraic group model
- Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model)
- On soundness notions for interactive oracle proofs
- To label, or not to label (in generic groups)
Uses Software
This page was built for publication: Tight state-restoration soundness in the algebraic group model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128989)
