Home > Resources > papers > DKLW25-Lattice-Proof-Friendly-Sigs

Lattice-Based Proof-Friendly Signatures from Vanishing Short Integer Solutions (Dubois, Klooß, Lai, Woo 2025)

Last modified: 2026-10-27

DOI: 10.1007/978-3-031-91820-9_15 · URL: https://doi.org/10.1007/978-3-031-91820-9_15

Summary

Proposes lattice-based signatures designed to admit efficient zero-knowledge proofs of knowledge of a signature, based on a new "vanishing short integer solutions" assumption (PKC 2025). They are candidates for post-quantum anonymous credentials in the spirit of BBS or PS. BL26-SoK-AnonCreds lists it among the quantum-safe multi-message signatures with efficient proofs, noting that the new assumptions need more study.

Related resources

• LaBRADOR: Compact Proofs for R1CS from Module-SIS (Beullens, Seiler 2023) (paper, 2023)
• Practical Post-Quantum Signatures for Privacy (Argo, Güneysu, Jeudy, Land, Roux-Langlois, Sanders 2024) (paper, 2024)
• SoK: Anonymous Credentials for Digital Identity Wallets (Bormann, Lehmann 2026) (paper, 2026)
• The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy (Lyubashevsky, Seiler, Steuer 2024) (paper, 2024)