Lattice-Based Group Signature Scheme with Verifier-Local Revocation

被引:0
作者
Langlois, Adeline [1 ]
Ling, San [2 ]
Khoa Nguyen [2 ]
Wang, Huaxiong [2 ]
机构
[1] U Lyon, CNRS, Ecole Normale Super Lyon, LIP,ENSL,INRIA,UCBL, 46 Allee Italie, F-69364 Lyon 07, France
[2] Nanyang Technol Univ, Sch Phys & Math Sci, Div Math Sci, Singapore, Singapore
来源
PUBLIC-KEY CRYPTOGRAPHY - PKC 2014 | 2014年 / 8383卷
关键词
group signature; verifier-local revocation; lattice-based cryptography; BACKWARD UNLINKABILITY; IDENTIFICATION; SECURE; FOUNDATIONS;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Support of membership revocation is a desirable functionality for any group signature scheme. Among the known revocation approaches, verifier-local revocation (VLR) seems to be the most flexible one, because it only requires the verifiers to possess some up-to-date revocation information, but not the signers. All of the contemporary VLR group signatures operate in the bilinear map setting, and all of them will be insecure once quantum computers become a reality. In this work, we introduce the first lattice-based VLR group signature, and thus, the first such scheme that is believed to be quantum-resistant. In comparison with existing lattice-based group signatures, our scheme has several noticeable advantages: support of membership revocation, logarithmicsize signatures, and weaker security assumption. In the random oracle model, our scheme is proved to be secure based on the hardness of the SIVP(O) over tilde (n1.5) problem in general lattices -an assumption that is as weak as those of state-of-the-art lattice-based standard signatures. Moreover, our construction works without relying on encryption schemes, which is an intriguing feature for group signatures.
引用
收藏
页码:345 / 361
页数:17
相关论文
共 40 条
  • [1] Ajtai M., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P99, DOI 10.1145/237814.237838
  • [2] Ajtai M., 1999, Automata, Languages and Programming. 26th International Colloquium, ICALP'99. Proceedings (Lecture Notes in Computer Science Vol.1644), P1
  • [3] Generating Shorter Bases for Hard Random Lattices
    Alwen, Joel
    Peikert, Chris
    [J]. THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) : 535 - 553
  • [4] [Anonymous], EFFICIENT PROT UNPUB
  • [5] [Anonymous], 2009, Post quantum cryptography
  • [6] [Anonymous], LNCS
  • [7] [Anonymous], 2014033 CRYPT
  • [8] Ateniese G, 2000, LECT NOTES COMPUT SC, V1880, P255
  • [9] Bellare M, 2005, LECT NOTES COMPUT SC, V3376, P136
  • [10] Bellare M, 2003, LECT NOTES COMPUT SC, V2656, P614