Time- and space-efficient arguments from groups of unknown order
From MaRDI portal
Publication:2139631
DOI10.1007/978-3-030-84259-8_5zbMath1489.94088OpenAlexW3147459559MaRDI QIDQ2139631
Ron D. Rothblum, Justin Holmgren, Pratik Soni, Alexander R. Block, Alon Rosen
Publication date: 18 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_5
Related Items (19)
Sumcheck arguments and their applications ⋮ Gemini: elastic SNARKs for diverse environments ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Certifying giant nonprimes ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ Parallelizable delegation from LWE ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Simple and efficient batch verification techniques for verifiable delay functions
Uses Software
Cites Work
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Parallel coin-tossing and constant-round secure two-party computation
- Verifiable delay functions
- Transparent SNARKs from DARK compilers
- SPARKs: succinct parallelizable arguments of knowledge
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Recursive proof composition from accumulation schemes
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Constant-Size Commitments to Polynomials and Their Applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Robust Characterizations of Polynomials with Applications to Program Testing
- Signatures of Correct Computation
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Simple verifiable delay functions
- Constant-round interactive proofs for delegating computation
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Computational Complexity
- Efficient verifiable delay functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Time- and space-efficient arguments from groups of unknown order
