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 条
  • [21] Software Speed Records for Lattice-Based Signatures
    Gueneysu, Tim
    Oder, Tobias
    Poeppelmann, Thomas
    Schwabe, Peter
    POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2013, 2013, 7932 : 67 - 82
  • [22] Asymptotically Efficient Lattice-Based Digital Signatures
    Vadim Lyubashevsky
    Daniele Micciancio
    Journal of Cryptology, 2018, 31 : 774 - 797
  • [23] Asymptotically efficient lattice-based digital signatures
    Lyubashevsky, Vadim
    Micciancio, Daniele
    THEORY OF CRYPTOGRAPHY, 2008, 4948 : 37 - 54
  • [24] Asymptotically Efficient Lattice-Based Digital Signatures
    Lyubashevsky, Vadim
    Micciancio, Daniele
    JOURNAL OF CRYPTOLOGY, 2018, 31 (03) : 774 - 797
  • [25] Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability
    del Pino, Rafael
    Lyubashevsky, Vadim
    Seiler, Gregor
    PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, : 574 - 591
  • [26] Fully Secure Lattice-based Group Signatures with Verifier-local Revocation
    Nisansala, M.
    Perera, S.
    Koshiba, Takeshi
    2017 IEEE 31ST INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2017, : 795 - 802
  • [27] Group signature with time-bound keys and unforgeability of expiry time for smart cities
    Fang, Junli
    Feng, Tao
    EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2021, 2021 (01)
  • [28] Sequential Half-Aggregation of Lattice-Based Signatures
    Boudgoust, Katharina
    Takahashi, Akira
    COMPUTER SECURITY - ESORICS 2023, PT I, 2024, 14344 : 270 - 289
  • [29] Efficient Lattice-Based Threshold Signatures With Functional Interchangeability
    Tang, Guofeng
    Pang, Bo
    Chen, Long
    Zhang, Zhenfeng
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2023, 18 : 4173 - 4187
  • [30] Shorter Hash-and-Sign Lattice-Based Signatures
    Espitau, Thomas
    Tibouchi, Mehdi
    Wallet, Alexandre
    Yu, Yang
    ADVANCES IN CRYPTOLOGY - CRYPTO 2022, PT II, 2022, 13508 : 245 - 275