Lattice-Based Group Signatures with Logarithmic Signature Size - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Lattice-Based Group Signatures with Logarithmic Signature Size


Group signatures are cryptographic primitives where users can anonymously sign messages in the name of a population they belong to. Gordon {\em et al.} (Asiacrypt 2010) suggested the first realization of group signatures based on lattice assumptions in the random oracle model. A significant drawback of their scheme is its linear signature size in the cardinality $N$ of the group. A recent extension proposed by Camenisch {\em et al.} (SCN 2012) suffers from the same overhead. In this paper, we describe the first lattice-based group signature schemes where the signature and public key sizes are essentially logarithmic in~$N$ (for any fixed security level). Our basic construction only satisfies a relaxed definition of anonymity (just like the Gordon {\it et al.} system) but readily extends into a fully anonymous group signature ({\it i.e.}, that resists adversaries equipped with a signature opening oracle). We prove the security of our schemes in the random oracle model under the SIS and LWE assumptions.
Fichier principal
Vignette du fichier
308.pdf (527.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00920420 , version 1 (31-03-2014)



Fabien Laguillaumie, Adeline Langlois, Benoît Libert, Damien Stehlé. Lattice-Based Group Signatures with Logarithmic Signature Size. ASIACRYPT 2013 - 19th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2013, Bangaluru, India. ⟨10.1007/978-3-642-42045-0_3⟩. ⟨hal-00920420⟩
183 View
265 Download



Gmail Facebook X LinkedIn More