Shorter Lattice-Based Group Signatures via ``Almost Free'' Encryption and Other Optimizations

Vadim Lyubashevsky; Ngoc Khanh Nguyen; Maxime Plancon; Gregor Seiler

Paper 2021/1575

Shorter Lattice-Based Group Signatures via ``Almost Free'' Encryption and Other Optimizations

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plancon, and Gregor Seiler

Abstract

We present an improved lattice-based group signature scheme whose parameter sizes and running times are independent of the group size. The signature length in our scheme is around $200$ KB, which is approximately a $3$ X reduction over the previously most compact such scheme, based on any quantum-safe assumption, of del Pino et al. (ACM CCS 2018). The improvement comes via several optimizations of some basic cryptographic components that make up group signature schemes, and we think that they will find other applications in privacy-based lattice cryptography.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: A major revision of an IACR publication in ASIACRYPT 2021
DOI: 10.1007/978-3-030-92068-5_8
Keywords: group signatures lattices
Contact author(s): vadim lyubash @ gmail com
nkn @ zurich ibm com
mpl @ zurich ibm com
grs @ zurich ibm com
History: 2021-12-03: received
Short URL: https://ia.cr/2021/1575
License: CC BY

BibTeX

@misc{cryptoeprint:2021/1575,
      author = {Vadim Lyubashevsky and Ngoc Khanh Nguyen and Maxime Plancon and Gregor Seiler},
      title = {Shorter Lattice-Based Group Signatures via ``Almost Free'' Encryption and Other Optimizations},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/1575},
      year = {2021},
      doi = {10.1007/978-3-030-92068-5_8},
      url = {https://eprint.iacr.org/2021/1575}
}