Tight state-restoration soundness in the algebraic group model
From MaRDI portal
Publication:2128989
DOI10.1007/978-3-030-84252-9_3zbMath1487.94116OpenAlexW3109521544MaRDI QIDQ2128989
Stefano Tessaro, Ashrujit Ghoshal
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_3
zero-knowledge proof systemsconcrete securityFiat-Shamir transformalgebraic group modelstate-restoration soundness
Related Items (10)
Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Revisiting BBS signatures ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency ⋮ To label, or not to label (in generic groups) ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ An analysis of the algebraic group model
Uses Software
Cites Work
- Unnamed Item
- The algebraic group model and its applications
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Interactive Oracle Proofs
- An Efficient Parallel Repetition Theorem
- Parallel Repetition Theorems for Interactive Arguments
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Algebraic methods for interactive proof systems
- The knowledge complexity of interactive proof-systems
- A Parallel Repetition Theorem for Any Interactive Argument
- Fiat-Shamir: from practice to theory
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Cryptography and Coding
This page was built for publication: Tight state-restoration soundness in the algebraic group model
