On the (In)Security of SNARKs in the Presence of Oracles
From MaRDI portal
Publication:3179354
DOI10.1007/978-3-662-53641-4_5zbMath1369.94534OpenAlexW2535475903MaRDI QIDQ3179354
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01378013/file/112.pdf
Related Items
On the (In)Security of SNARKs in the Presence of Oracles, Plumo: an ultralight blockchain client, Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- On the complexity of interactive proofs with bounded communication
- Does co-NP have short interactive proofs ?
- Minimum disclosure proofs of knowledge
- On interactive proofs with a laconic prover
- The hunting of the SNARK
- Limits of Extractability Assumptions with Distributional Auxiliary Input
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Fully Homomorphic Message Authenticators
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Homomorphic Signatures for Polynomial Functions
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- On the (In)Security of SNARKs in the Presence of Oracles
- Succinct NP Proofs from an Extractability Assumption
- Polylogarithmic two-round argument systems
- Universal Arguments and their Applications
- The Knowledge Complexity of Interactive Proof Systems
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Practical Homomorphic MACs for Arithmetic Circuits
- Quadratic Span Programs and Succinct NIZKs without PCPs
- On the existence of extractable one-way functions
- Functional Signatures and Pseudorandom Functions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
