Verifier-local revocation group signatures with backward unlinkability from lattices

被引:2
作者
Zhang, Yanhua [1 ]
Liu, Ximeng [2 ]
Hu, Yupu [3 ]
Gan, Yong [4 ]
Jia, Huiwen [5 ]
机构
[1] Zhengzhou Univ Light Ind, Coll Comp & Commun Engn, Zhengzhou 450001, Peoples R China
[2] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou 350108, Peoples R China
[3] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China
[4] Zhengzhou Univ Technol, Coll Informat Engn, Zhengzhou 450044, Peoples R China
[5] Guangzhou Univ, Sch Math & Informat Sci, Guangzhou 510006, Peoples R China
基金
中国国家自然科学基金;
关键词
Group signature; Lattice-based cryptography; Verifier-local revocation; Backward unlikability; Short integer solution; SCHEMES; DEFINITIONS; FOUNDATIONS;
D O I
10.1631/FITEE.2000507
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
For group signature (GS) supporting membership revocation, verifier-local revocation (VLR) mechanism seems to be a more flexible choice, because it requires only that verifiers download up-to-date revocation information for signature verification, and the signers are not involved. As a post-quantum secure cryptographic counterpart of classical number-theoretic cryptographic constructions, the first lattice-based VLR group signature (VLR-GS) was introduced by Langlois et al. (2014). However, none of the contemporary lattice-based VLR-GS schemes provide backward unlinkability (BU), which is an important property to ensure that previously issued signatures remain anonymous and unlinkable even after the corresponding signer (i.e., member) is revoked. In this study, we introduce the first lattice-based VLR-GS scheme with BU security (VLR-GS-BU), and thus resolve a prominent open problem posed by previous works. Our new scheme enjoys an O(log N) factor saving for bit-sizes of the group public-key (GPK) and the member's signing secret-key, and it is free of any public-key encryption. In the random oracle model, our scheme is proven secure under two well-known hardness assumptions of the short integer solution (SIS) problem and learning with errors (LWE) problem.
引用
收藏
页码:876 / 892
页数:17
相关论文
共 33 条
  • [1] Agrawal S, 2010, LECT NOTES COMPUT SC, V6110, P553
  • [2] Ajtai M., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P99, DOI 10.1145/237814.237838
  • [3] Generating Shorter Bases for Hard Random Lattices
    Alwen, Joel
    Peikert, Chris
    [J]. THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) : 535 - 553
  • [4] Bellare M, 2005, LECT NOTES COMPUT SC, V3376, P136
  • [5] Bellare M, 2003, LECT NOTES COMPUT SC, V2656, P614
  • [6] Boneh D., 2004, CCS 04, P168
  • [7] Foundations of Fully Dynamic Group Signatures
    Bootle, Jonathan
    Cerulli, Andrea
    Chaidos, Pyrros
    Ghadafi, Essam
    Groth, Jens
    [J]. APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2016, 2016, 9696 : 117 - 136
  • [8] Cash D, 2010, LECT NOTES COMPUT SC, V6110, P523
  • [9] CHAUM D, 1991, LECT NOTES COMPUT SC, V547, P257
  • [10] A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
    Emura, Keita
    Hayashi, Takuya
    [J]. INFORMATION SECURITY (ISC 2018), 2018, 11060 : 442 - 460