Group signatures from lattices : simpler, tighter, shorter, ring-based
Date of Issue2015
School of Physical and Mathematical Sciences
We introduce a lattice-based group signature scheme that provides several noticeable improvements over the contemporary ones: simpler construction, weaker hardness assumptions, and shorter sizes of keys and signatures. Moreover, our scheme can be transformed into the ring setting, resulting in a scheme based on ideal lattices, in which the public key and signature both have bit-size e õ(n ∙ logN), for security parameter n, and for group of N users. Towards our goal, we construct a new lattice-based cryptographic tool: a statistical zero-knowledge argument of knowledge of a valid message-signature pair for Boyen's signature scheme (Boyen, PKC'10), which potentially can be used as the building block to design various privacy-enhancing cryptographic constructions.
DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory
Lecture notes in computer science
© 2015 International Association for Cryptologic Research. This is the author created version of a work that has been peer reviewed and accepted for publication by Lecture Notes in Computer Science, International Association for Cryptologic Research. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [Article DOI: http://dx.doi.org/10.1007/978-3-662-46447-2_19].