Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations

DOI10.1007/978-3-030-92068-5_8MaRDI QIDQ6041285zbMATH OpenOpenAlexFDO

Authors Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler

Publication date 26 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-92068-5_8

zbMATH Keywords

group signatureszero-knowledgelattice cryptography

Mathematics Subject Classification ID

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

Recommendations

• Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
• Floppy-sized group signatures from lattices
• Simpler efficient group signatures from lattices
• Lattice-based group signatures with logarithmic signature size
• Constant-size group signatures from lattices

Cites work

• scientific article; zbMATH DE number 1302859 (Why is no real title available?)
• scientific article; zbMATH DE number 1088250 (Why is no real title available?)
• A Group Signature Scheme from Lattice Assumptions
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• Efficient lattice (H)IBE in the standard model
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Floppy-sized group signatures from lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Lattice signatures and bimodal Gaussians
• Lattice signatures without trapdoors
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• More efficient commitments from structured lattice assumptions
• New bounds in some transference theorems in the geometry of numbers
• On lattices, learning with errors, random linear codes, and cryptography
• One-shot verifiable encryption from lattices
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Practical product proofs for lattice commitments
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Short lattice-based one-out-of-many proofs and applications to ring signatures
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Worst-case to average-case reductions for module lattices
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors

Cited in

(16)

• Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
• Practical sublinear proofs for R1CS from lattices
• Aggregating Falcon signatures with LaBRADOR
• A framework for practical anonymous credentials from lattices
• Lattice signature with efficient protocols, application to anonymous credentials
• Floppy-sized group signatures from lattices
• On methods of shortening ElGamal-type signatures
• Compact privacy protocols from post-quantum and timed classical assumptions
• Lattice-based threshold, accountable, and private signature
• BLOOM: bimodal lattice one-out-of-many proofs and applications
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Efficient lattice-based blind signatures via Gaussian one-time signatures
• Ring/module learning with errors under linear leakage -- hardness and applications
• A generic construction of an anonymous reputation system and instantiations from lattices
• Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
• Toward practical lattice-based proof of knowledge from Hint-MLWE

This page was built for publication: Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041285)