Constant-Size Group Signatures From Lattices
PUBLIC-KEY CRYPTOGRAPHY - PKC 2018, PT II(2018)
摘要
Lattice-based group signature is an active research topic in recent years. Since the pioneering work by Gordon, Katz and Vaikuntanathan (Asiacrypt 2010), ten other schemes have been proposed, providing various improvements in terms of security, efficiency and functionality. However, in all known constructions, one has to fix the number N of group users in the setup stage, and as a consequence, the signature sizes are dependent on N.In this work, we introduce the first constant-size group signature from lattices, which means that the size of signatures produced by the scheme is independent of N and only depends on the security parameter lambda. More precisely, in our scheme, the sizes of signatures, public key and users' secret keys are all of order (O) over tilde(lambda). The scheme supports dynamic enrollment of users and is proven secure in the random oracle model under the Ring Short Integer Solution (RSIS) and Ring Learning With Errors (RLWE) assumptions. At the heart of our design is a zero-knowledge argument of knowledge of a valid message-signature pair for the DucasMicciancio signature scheme (Crypto 2014), that may be of independent interest.
更多查看译文
关键词
Lattice-based cryptography, Constant-size group signatures, Zero-knowledge proofs, Ducas-Micciancio signature
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络