Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
From MaRDI portal
Publication:1784111
DOI10.1007/978-3-319-96881-0_23zbMath1436.94040OpenAlexW2883563728MaRDI QIDQ1784111
Carsten Baum, Andrea Cerulli, Jens Groth, Vadim Lyubashevsky, Rafael del Pino, Jonathan Bootle
Publication date: 26 September 2018
Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10059121/
Related Items (27)
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Subquadratic SNARGs in the random oracle model ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Asymptotically quasi-optimal cryptography ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ Succinct arguments in the quantum random oracle model ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Practical sublinear proofs for R1CS from lattices ⋮ Verifiable decryption in the head ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Lower bound on SNARGs in the random oracle model ⋮ Orion: zero knowledge proof with linear prover time ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ Laconic private set intersection and applications ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ Boosting verifiable computation on encrypted data ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ Zero-knowledge proofs for committed symmetric Boolean functions
This page was built for publication: Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
