Parallelizable delegation from LWE
From MaRDI portal
Publication:6114288
DOI10.1007/978-3-031-22365-5_22zbMath1521.94042OpenAlexW4312730681MaRDI QIDQ6114288
Rafael Pass, Cody Freitag, Naomi Sirkin
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_22
Related Items (2)
PPAD is as hard as LWE and iterated squaring ⋮ Correlation intractability and SNARGs from sub-exponential DDH
Cites Work
- Unnamed Item
- Static-memory-hard functions, and modeling the cost of space vs. time
- Sustained space complexity
- Verifiable delay functions
- The hunting of the SNARK
- SPARKs: succinct parallelizable arguments of knowledge
- Continuous verifiable delay functions
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Tight verifiable delay functions
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Time- and space-efficient arguments from groups of unknown order
- Linear-size constant-query IOPs for delegating computation
- Scalable zero knowledge with no trusted setup
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- High Parallel Complexity Graphs and Memory-Hard Functions
- Proof verification and the hardness of approximation problems
- Delegating Computation
- Interactive Oracle Proofs
- Delegating RAM Computations
- Short PCPs with Polylog Query Complexity
- Universal Arguments and their Applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Computationally Sound Proofs
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Constant-Round Interactive Proofs for Delegating Computation
- Simple verifiable delay functions
- How to delegate computations publicly
- How to delegate computations
- Depth-Robust Graphs and Their Cumulative Memory Complexity
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Pebbling and Proofs of Work
- On the concrete efficiency of probabilistically-checkable proofs
- On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
- Efficient verifiable delay functions
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
This page was built for publication: Parallelizable delegation from LWE
