Quasi-optimal SNARGs via linear multi-prover interactive proofs
From MaRDI portal
Publication:1653086
DOI10.1007/978-3-319-78372-7_8zbMath1415.94413OpenAlexW2794524511MaRDI QIDQ1653086
Dan Boneh, Amit Sahai, Yuval Ishai, David J. Wu
Publication date: 17 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78372-7_8
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (20)
Subquadratic SNARGs in the random oracle model ⋮ Sumcheck arguments and their applications ⋮ Asymptotically quasi-optimal cryptography ⋮ Succinct arguments in the quantum random oracle model ⋮ Explainable arguments ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ NIZK from SNARGs ⋮ Oblivious transfer with constant computational overhead ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ Lower bound on SNARGs in the random oracle model ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ On succinct arguments and witness encryption from groups ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge
This page was built for publication: Quasi-optimal SNARGs via linear multi-prover interactive proofs
