Succinct Non-interactive Arguments via Linear Interactive Proofs

DOI10.1007/978-3-642-36594-2_18zbMath1316.68056OpenAlexW1890128745MaRDI QIDQ4910285

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

Mathematics Subject Classification ID

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

Related Items (62)

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

This page was built for publication: Succinct Non-interactive Arguments via Linear Interactive Proofs