Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II

DOI10.1007/978-3-031-22318-1_17zbMath1521.94028MaRDI QIDQ6169368

Dan Carmon, David Levit, Eli Ben-Sasson, Swastik Kopparty

Publication date: 14 August 2023

Published in: Theory of Cryptography (Search for Journal in Brave)

zbMATH Keywords

interactive oracle proofsarithmetization schemeelliptic curve codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (4)

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 ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-deterministic exponential time has two-prover interactive protocols
• Zero knowledge protocols from succinct constraint detection
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• Linear-time arguments with sublinear verification from tensor codes
• Subquadratic SNARGs in the random oracle model
• Succinct arguments in the quantum random oracle model
• Linear-size constant-query IOPs for delegating computation
• Scalable zero knowledge with no trusted setup
• Tight security bounds for Micali's SNARGs
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Proof verification and the hardness of approximation problems
• Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
• Interactive Oracle Proofs
• Short PCPs with Polylog Query Complexity
• The Arithmetic of Elliptic Curves
• Elliptic Curve Cryptosystems
• Probabilistic checking of proofs
• Algebraic methods for interactive proof systems
• IP = PSPACE
• Computationally Sound Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity
• Constant-round interactive proofs for delegating computation
• On the concrete efficiency of probabilistically-checkable proofs
• On the Size of Pairing-Based Non-interactive Arguments
• Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II

This page was built for publication: Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II