Straight-line knowledge extraction for multi-round protocols
From MaRDI portal
Cites work
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- A non-PCP approach to succinct quantum-safe zero-knowledge
- A second look at Fischlin's transformation
- Advances in Cryptology - CRYPTO 2003
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Computationally binding quantum commitments
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Cryptography and Coding
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model)
- Fiat-Shamir transformation of multi-round interactive proofs
- Foundations of Cryptography
- Gemini: elastic SNARKs for diverse environments
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 2009955 (Why is no real title available?)
- HyperNova: recursive arguments for customizable constraint systems
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- Programmable Hash Functions and Their Applications
- Proofs for inner pairing products and applications
- Quantum attacks on classical proof systems: the hardness of quantum rewinding
- Quantum proofs of knowledge
- Quantum rewinding for many-round protocols
- Random oracles in a quantum world
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Securing threshold cryptosystems against chosen ciphertext attack
- Security arguments for digital signatures and blind signatures
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- SOFIA: \(\mathcal{MQ}\)-based signatures in the QROM
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Subvector commitments with application to succinct arguments
- Succinct arguments in the quantum random oracle model
- Sumcheck arguments and their applications
- The algebraic group model and its applications
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Tight state-restoration soundness in the algebraic group model
- Transparent SNARKs from DARK compilers
- Universally composable -protocols in the global random-oracle model
- Vector commitments and their applications
- Witness-succinct universally-composable SNARKs
This page was built for publication: Straight-line knowledge extraction for multi-round protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862540)
