Paper 2025/356
Lattice-based Proof-Friendly Signatures from Vanishing Short Integer Solutions
Abstract
Efficient anonymous credentials are typically constructed by combining proof-friendly signature schemes with compatible zero-knowledge proof systems. Inspired by pairing-based proof-friendly signatures such as Boneh- Boyen (BB) and Boneh-Boyen-Shacham (BBS), we propose a wide family of lattice-based proof-friendly signatures based on variants of the vanishing short integer solution (vSIS) assumption [Cini-Lai-Malavolta, Crypto'23]. In particular, we obtain natural lattice-based adaptions of BB and BBS which, similar to their pairing-based counterparts, admit nice algebraic properties.
[Bootle-Lyubashevsky-Nguyen-Sorniotti, Crypto'23] (BLNS) recently proposed a framework for constructing lattice-based proof-friendly signatures and anonymous credentials, based on another new lattice assumption called
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published by the IACR in PKC 2025
- Keywords
- lattice cryptographyproof-friendly signaturesBBS signaturevanishing SISISIS_f assumption
- Contact author(s)
-
adrien dubois @ ens-lyon fr
klooss @ mail informatik kit edu
russell lai @ aalto fi
ivy woo @ aalto fi - History
- 2025-03-04: approved
- 2025-02-25: received
- See all versions
- Short URL
- https://ia.cr/2025/356
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/356, author = {Adrien Dubois and Michael Klooß and Russell W. F. Lai and Ivy K. Y. Woo}, title = {Lattice-based Proof-Friendly Signatures from Vanishing Short Integer Solutions}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/356}, year = {2025}, url = {https://eprint.iacr.org/2025/356} }