On the simulation-extractability of proof-carrying data
From MaRDI portal
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- \textsc{Arc}: accumulation for Reed-Solomon codes
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- An algebraic framework for universal and updatable SNARKs
- Another look at extraction and randomization of Groth's zk-SNARK
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- From polynomial IOP and commitments to non-malleable zkSNARKs
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- HyperNova: recursive arguments for customizable constraint systems
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Incrementally verifiable computation via incremental PCPs
- Incrementally verifiable computation via rate-1 batch arguments
- Malleable proof systems and applications
- Mangrove: a scalable framework for folding-based SNARKs
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Nova: recursive zero-knowledge arguments from folding schemes
- On succinct non-interactive arguments in relativized worlds
- Proof-carrying data without succinct arguments
- Rate-1 non-interactive arguments for batch-NP and applications
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Recursive proof composition from accumulation schemes
- Scalable zero knowledge via cycles of elliptic curves
- Security bounds for proof-carrying data from straightline extractors
- SNARKs for virtual machines are non-malleable
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Spartan and bulletproofs are simulation-extractable (for free!)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Universally composable security: a new paradigm for cryptographic protocols
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- zkSNARKs in the ROM with unconditional UC-security
This page was built for publication: On the simulation-extractability of proof-carrying data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390884)
