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 条
  • [31] Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
    Gueneysu, Tim
    Lyubashevsky, Vadim
    Poeppelmann, Thomas
    IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (07) : 1954 - 1967
  • [32] Lattice-based sequential aggregate signatures with lazy verification
    Zhang Yanhua
    Hu Yupu
    Jiang Mingming
    Xue Lili
    The Journal of China Universities of Posts and Telecommunications, 2015, 22 (06) : 36 - 44
  • [33] Lattice-based linearly homomorphic signatures in the standard model
    Chen, Wenbin
    Lei, Hao
    Qi, Ke
    THEORETICAL COMPUTER SCIENCE, 2016, 634 : 47 - 54
  • [34] Compact and Provably Secure Lattice-Based Signatures in Hardware
    Howe, James
    Rafferty, Ciara
    Khalid, Ayesha
    O'Neill, Maire
    2017 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2017,
  • [35] Lattice-Based Signatures with Tight Adaptive Corruptions and More
    Pan, Jiaxin
    Wagner, Benedikt
    PUBLIC-KEY CRYPTOGRAPHY, PKC 2022, PT II, 2022, 13178 : 347 - 378
  • [36] Lattice-based sequential aggregate signatures with lazy verification
    Zhang, Yanhua
    Hu, Yupu
    Jiang, Mingming
    Xue, Lili
    Journal of China Universities of Posts and Telecommunications, 2015, 22 (06): : 36 - 44
  • [37] On Removing Rejection Conditions in Practical Lattice-Based Signatures
    Behnia, Rouzbeh
    Chen, Yilei
    Masny, Daniel
    POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2021, 2021, 12841 : 380 - 398
  • [38] Lattice-based sequential aggregate signatures with lazy verification
    Zhang Yanhua
    Hu Yupu
    Jiang Mingming
    Xue Lili
    The Journal of China Universities of Posts and Telecommunications, 2015, (06) : 36 - 44
  • [39] Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
    Boneh, Dan
    Freeman, David Mandell
    PUBLIC KEY CRYPTOGRAPHY - PKC 2011, 2011, 6571 : 1 - 16
  • [40] Group signature with time-bound keys and unforgeability of expiry time for smart cities
    Junli Fang
    Tao Feng
    EURASIP Journal on Wireless Communications and Networking, 2021