Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
From MaRDI portal
Publication:2181849
DOI10.1007/978-3-030-26948-7_7zbMath1456.94054OpenAlexW2967347604MaRDI QIDQ2181849
Jonathan Bootle, Gregor Seiler, Vadim Lyubashevsky
Publication date: 20 May 2020
Full work available at URL: https://zenodo.org/record/3379665
Related Items (35)
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over 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 ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Multimodal private signatures ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ A framework for practical anonymous credentials from lattices ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Lattice-based e-cash, revisited ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ Practical product proofs for lattice commitments ⋮ Covert authentication from lattices
This page was built for publication: Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
