Short lattice-based one-out-of-many proofs and applications to ring signatures

DOI10.1007/978-3-030-21568-2_4zbMath1458.94299OpenAlexW2893049749MaRDI QIDQ2291378

Ron Steinfeld, Amin Sakzad, Dongxi Liu, Joseph K. Liu, Muhammed F. Esgin

Publication date: 30 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-21568-2_4

zbMATH Keywords

lattice-based cryptographyring signaturezero-knowledge proof

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (25)

DualRing: generic construction of ring signatures with efficient instantiations ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ 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 ⋮ Post-quantum adaptor signature for privacy-preserving off-chain payments ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ On tightly-secure (linkable) ring signatures ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Extendable threshold ring signatures with enhanced anonymity ⋮ Practical sublinear proofs for R1CS from lattices ⋮ Efficient unique ring signatures from lattices ⋮ Count me in! Extendability for threshold ring signatures ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Lattice-based inner product argument ⋮ Post-quantum asynchronous deniable key exchange and the signal handshake ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ Adding Linkability to Ring Signatures with One-Time Signatures ⋮ 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 ⋮ Practical product proofs for lattice commitments

This page was built for publication: Short lattice-based one-out-of-many proofs and applications to ring signatures