Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
From MaRDI portal
Publication:2692384
DOI10.1007/978-3-030-64834-3_9OpenAlexW3031679272MaRDI QIDQ2692384
Gregor Seiler, Muhammed F. Esgin, Ngoc Khanh Nguyen
Publication date: 21 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64834-3_9
Related Items (28)
Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Practical sublinear proofs for R1CS from lattices ⋮ 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) ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ Practical product proofs for lattice commitments ⋮ Covert authentication from lattices
Uses Software
Cites Work
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Lattice-based zero-knowledge arguments for integer relations
- More efficient commitments from structured lattice assumptions
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Practical product proofs for lattice commitments
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Aurora: transparent succinct arguments for R1CS
- Worst-case to average-case reductions for module lattices
- Lattice Signatures without Trapdoors
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- On Ideal Lattices and Learning with Errors over Rings
- Universally composable two-party and multi-party secure computation
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A new identification scheme based on syndrome decoding
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Theory of Cryptography
This page was built for publication: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
