Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
From MaRDI portal
Publication:2181847
DOI10.1007/978-3-030-26948-7_5zbMath1456.94075OpenAlexW2947254643MaRDI QIDQ2181847
Joseph K. Liu, Dongxi Liu, Muhammed F. Esgin, Ron Steinfeld
Publication date: 20 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26948-7_5
lattice-based cryptographyring signaturezero-knowledge proofrange proofCRT packingone-out-of-many proofset membership proof
Related Items (32)
DualRing: generic construction of ring signatures with efficient instantiations ⋮ 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 ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable ⋮ One-time traceable ring signatures ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Practical sublinear proofs for R1CS from lattices ⋮ Multimodal private signatures ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ A framework for practical anonymous credentials from lattices ⋮ Orion: zero knowledge proof with linear prover time ⋮ Post-quantum asynchronous deniable key exchange and the signal handshake ⋮ \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 ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices ⋮ 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 ⋮ Impossibility results for lattice-based functional encryption schemes ⋮ Signatures from sequential-OR proofs ⋮ 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: Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
