Succinct non-interactive arguments via linear interactive proofs

DOI10.1007/978-3-642-36594-2_18zbMATH Open1316.68056OpenAlexW1890128745MaRDI QIDQ4910285FDOQ4910285

Rafail Ostrovsky, Omer Paneth, Alessandro Chiesa, Yuval Ishai, Nir Bitansky

Publication date: 18 March 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_18

Recommendations

Succinct non-interactive arguments via linear interactive proofs
Quasi-optimal SNARGs via linear multi-prover interactive proofs
On succinct arguments and witness encryption from groups
On the size of pairing-based non-interactive arguments
Succinct arguments from multi-prover interactive proofs and their efficiency benefits

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (73)

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines
Succinct non-interactive secure computation
On the (In)security of Kilian-based SNARGs
Rational Sumchecks
No-signaling linear PCPs
Delegating RAM Computations
A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
Subquadratic SNARGs in the random oracle model
Computational Integrity with a Public Random String from Quasi-Linear PCPs
SnarkPack: practical SNARK aggregation
Fine-grained secure computation
How to build time-lock encryption
Multikey Fully Homomorphic Encryption and Applications
Rinocchio: SNARKs for ring arithmetic
Secure multiparty computation with sublinear preprocessing
Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
An efficient identity tracing scheme for blockchain-based systems
HyperPlonk: Plonk with linear-time prover and high-degree custom gates
Ligero: lightweight sublinear arguments without a trusted setup
Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
\(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
Non-interactive publicly-verifiable delegation of committed programs
MyOPE: malicious security for oblivious polynomial evaluation
Practical witness-key-agreement for blockchain-based dark pools financial trading
Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
Constant-Round Interactive Proofs for Delegating Computation
No-signaling linear PCPs
Asymptotically quasi-optimal cryptography
On succinct non-interactive arguments in relativized worlds
SNARGs for P from sub-exponential DDH and QR
Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Transparent SNARKs from DARK compilers
Spartan: efficient and general-purpose zkSNARKs without trusted setup
Succinct arguments in the quantum random oracle model
A Unified Framework for Non-universal SNARKs
Updateable Inner Product Argument with Logarithmic Verifier and Applications
On the (In)Security of SNARKs in the Presence of Oracles
Shorter arithmetization of nondeterministic computations
Scalable zero knowledge via cycles of elliptic curves
Interactive Oracle Proofs
Verifiable Computation and Succinct Arguments for NP
The hunting of the SNARK
Sublinear Zero-Knowledge Arguments for RAM Programs
On the existence of extractable one-way functions
Marlin: preprocessing zkSNARKs with universal and updatable SRS
Lower bound on SNARGs in the random oracle model
On succinct arguments and witness encryption from groups
On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
A simple and efficient framework of proof systems for NP
Lattice-based succinct arguments for NP with polylogarithmic-time verification
Succinct arguments for RAM programs via projection codes
Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
Lattice-based functional commitments: fast verification and cryptanalysis
\textsf{Orbweaver}: succinct linear functional commitments from lattices
Non-interactive zero-knowledge from non-interactive batch arguments
Correlation intractability and SNARGs from sub-exponential DDH
Succinct verification of compressed sigma protocols in the updatable SRS setting
Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
SLAP: succinct lattice-based polynomial commitments from standard assumptions
Adaptively sound zero-knowledge SNARKs for UP
Adaptive security in SNARGs via iO and lossy functions
Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
NIZK from SNARGs
Counting vampires: from univariate sumcheck to updatable ZK-SNARK

This page was built for publication: Succinct non-interactive arguments via linear interactive proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910285)