Lattice-Based Group Signatures With Time-Bound Keys via Redactable Signatures

被引:3
|
作者
Tang, Yongli [1 ]
Li, Yuanhong [1 ]
Ye, Qing [2 ]
He, Debiao [3 ,4 ]
机构
[1] Henan Polytech Univ, Sch Comp Sci & Technol, Jiaozuo 454000, Peoples R China
[2] Xian Univ Technol, Fac Comp Sci & Engn, Xian 710048, Peoples R China
[3] Qilu Univ Technol, Shandong Acad Sci, Shandong Prov Key Lab Comp Networks, Jinan 250014, Peoples R China
[4] Wuhan Univ, Sch Cyber Sci & Engn, Wuhan 430072, Peoples R China
基金
中国国家自然科学基金;
关键词
Costs; Lattices; Manganese; Computer science; Read only memory; Computational modeling; Computational efficiency; Group signatures; time-bound keys; lattice-based cryptography; anonymity;
D O I
10.1109/TIFS.2023.3268574
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Group signatures are active cryptographic topics where group members are granted right to sign messages anonymously on behalf of their group. However, in practical applications, such rights are not permanent in most cases and are usually limited to some time periods. This means that the signing right of each group member needs to be associated with time periods such that it can be automatically changed with the latter. Among the known approaches, verifier local revocation (VLR) seems to be the feasible one to implement the above functionality, but it will cause an inefficient verification process when the group size is large. In this paper, we describe a group signature scheme with time-bound keys, based on the hardness of lattice assumption, which implements the limitation of the signing right to any time period by constructing a lattice-based redactable signature scheme. Our scheme still adds VLR mechanism for some members who need to revoke prematurely, but the time-bound keys function ensures such members are only a small fraction that do not incur excessive cost for revocation check. We give implementation for our scheme under 93-bit and 207-bit security respectively to demonstrate the practicability-all costs are independent of the group size and achieve a relatively efficient level.
引用
收藏
页码:2696 / 2708
页数:13
相关论文
共 50 条
  • [41] A novel broadcast encryption based on time-bound cryptographic keys
    Mihaljevic, Miodrag J.
    Fossorier, Marc P. C.
    Imai, Hideki
    DIGITAL RIGHTS MANAGEMENT: TECHNOLOGIES, ISSUES, CHALLENGES AND SYSTEMS, 2006, 3919 : 258 - 276
  • [42] Almost Fully Secured Lattice-Based Group Signatures with Verifier-Local Revocation
    Perera, Maharage Nisansala Sevwandi
    Koshiba, Takeshi
    CRYPTOGRAPHY, 2020, 4 (04) : 1 - 28
  • [43] Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
    Libert, Benoit
    Ling, San
    Nguyen, Khoa
    Wang, Huaxiong
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT II, 2016, 9666 : 1 - 31
  • [44] Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
    Benoît Libert
    San Ling
    Khoa Nguyen
    Huaxiong Wang
    Journal of Cryptology, 2023, 36
  • [45] Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
    Libert, Benoit
    Ling, San
    Nguyen, Khoa
    Wang, Huaxiong
    JOURNAL OF CRYPTOLOGY, 2023, 36 (03)
  • [46] Message Integration Authentication in the Internet-of-Things via Lattice-Based Batch Signatures
    Lu, Xiuhua
    Yin, Wei
    Wen, Qiaoyan
    Liang, Kaitai
    Chen, Liqun
    Chen, Jiageng
    SENSORS, 2018, 18 (11)
  • [47] Practical, Round-Optimal Lattice-Based Blind Signatures
    Agrawal, Shweta
    Kirshanova, Elena
    Stehle, Damien
    Yadav, Anshu
    PROCEEDINGS OF THE 2022 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, CCS 2022, 2022, : 39 - 53
  • [48] HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures
    Cheon, Jung Hee
    Choe, Hyeongmin
    Devevey, Julien
    Güneysu, Tim
    Hong, Dongyeon
    Krausz, Markus
    Land, Georg
    Möller, Marc
    Stehlé, Damien
    Yi, Minjune
    IACR Transactions on Cryptographic Hardware and Embedded Systems, 2024, 2024 (03): : 25 - 75
  • [49] GALACTICS: Gaussian Sampling for Lattice-Based Constant Time Implementation of Cryptographic Signatures, Revisited
    Barthe, Gilles
    Belaid, Sonia
    Espitau, Thomas
    Fouque, Pierre-Alain
    Rossi, Melissa
    Tibouchi, Mehdi
    PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, : 2147 - 2164
  • [50] Leakage-resilient lattice-based partially blind signatures
    Papachristoudis, Dimitrios
    Hristu-Varsakelis, Dimitrios
    Baldimtsi, Foteini
    Stephanides, George
    IET INFORMATION SECURITY, 2019, 13 (06) : 670 - 684