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 条
  • [1] Verifier-Local Revocation Group Signatures with Time-Bound Keys
    Chu, Cheng-Kang
    Liu, Joseph K.
    Huang, Xinyi
    Zhou, Jianying
    7TH ACM SYMPOSIUM ON INFORMATION, COMPUTER AND COMMUNICATIONS SECURITY (ASIACCS 2012), 2012,
  • [2] AnoPas: Practical anonymous transit pass from group signatures with time-bound keys
    Shi, Rui
    Yang, Yang
    Li, Yingjiu
    Feng, Huamin
    Pang, Hwee Hwa
    Deng, Robert H.
    JOURNAL OF SYSTEMS ARCHITECTURE, 2024, 153
  • [3] Group Signatures with Time-Bound Keys Revisited: A New Model, an Efficient Construction, and its Implementation
    Emura, Keita
    Hayashi, Takuya
    Ishida, Ai
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2020, 17 (02) : 292 - 305
  • [4] Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures
    Lyubashevsky, Vadim
    Ngoc Khanh Nguyen
    Plancon, Maxime
    PUBLIC-KEY CRYPTOGRAPHY, PKC 2022, PT II, 2022, 13178 : 498 - 527
  • [5] Light-weight group signatures with time-bound membership
    Malina, Lukas
    Hajny, Jan
    Zeman, Vaclav
    SECURITY AND COMMUNICATION NETWORKS, 2016, 9 (07) : 599 - 612
  • [6] Lattice-Based Group Signatures with Logarithmic Signature Size
    Laguillaumie, Fabien
    Langlois, Adeline
    Libert, Benoit
    Stehle, Damien
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2013, PT II, 2013, 8270 : 41 - 61
  • [7] Lattice-based digital signatures
    Lyubashevsky, Vadim
    NATIONAL SCIENCE REVIEW, 2021, 8 (09)
  • [8] Lattice-Based Blind Signatures
    Rueckert, Markus
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2010, 2010, 6477 : 413 - 430
  • [9] Lattice-based digital signatures
    Vadim Lyubashevsky
    National Science Review, 2021, 8 (09) : 9 - 10
  • [10] Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations
    Lyubashevsky, Vadim
    Ngoc Khanh Nguyen
    Plancon, Maxime
    Seiler, Gregor
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2021, PT IV, 2021, 13093 : 218 - 248