Efficient group signature scheme using lattices

被引:2
作者
Abhilash M.H. [1 ]
Amberker B.B. [1 ]
机构
[1] Department of Computer Science and Engineering, National Institute of Technology, Telangana, Warangal
关键词
Group signature scheme; Lattice based cryptography; Revocation; Time bound keys; VLR;
D O I
10.1007/s41870-022-00891-3
中图分类号
学科分类号
摘要
Group signature scheme is a cryptographic primitive that allows its registered group users (or members) to generate signatures on behalf of the whole group without revealing their identity. An important feature of a group signature scheme is revocation, which allows an authorized entity called group manager to remove users from the group. Verifier Local Revocation (VLR) is a most commonly used revocation mechanism in group signature schemes because of its simplicity and efficiency. In VLR, the group manager maintains a publicly available revocation list that contains information about the revoked users. The cost of group signature verification is proportional to the size of the revocation list. To decrease the verification cost, it is enough to reduce the size of the revocation list. We use the notion of time bound signing keys for this and propose a dynamic group signature scheme. In the proposed scheme, an expiration time τ is fixed for the signing key of each group member. A user who is generating signature at time t must prove, he is a valid group member and his signing key is not expired, i.e., t≤ τ. Group user after the signing key expiration time are considered as ‘naturally’ revoked. Group users may be revoked before the expiration time if necessary, and it is considered ‘premature’ revocation. Hence, the revocation list needs to include the information about prematurely revoked users only. As a result, the size of the revocation list will be small, particularly in situations where natural revocation accounts for a large proportion of the total revocation. © 2022, The Author(s), under exclusive licence to Bharati Vidyapeeth's Institute of Computer Applications and Management.
引用
收藏
页码:1845 / 1854
页数:9
相关论文
共 28 条
  • [1] Abhilash M.H., Amberker B.B., Efficient dynamic group signature scheme with verifier local revocation and time-bound keys using lattices, Int J Comput Inf Technol, 10, 2, (2021)
  • [2] Alwen J., Peikert C., Generating shorter bases for hard random lattices. In: 26th international symposium on theoretical aspects of computer science STACS, IBFI Schloss Dagstuhl, pp. 75-86, (2009)
  • [3] Boneh D., Shacham H., Group signatures with verifier-local revocation, Proceedings of the 11Th ACM Conference on Computer and Communications Security, pp. 168-177, (2004)
  • [4] Brakerski Z., Langlois A., Peikert C., Regev O., Stehle D., Classical hardness of learning with errors, Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 575-584, (2013)
  • [5] Brickell E., An Efficient Protocol for Anonymously Providing Assurance of the Container of a Private Key, (2003)
  • [6] Camenisch J., Neven G., Ruckert M., Fully anonymous attribute tokens from lattices, International Conference on Security and Cryptography for Networks, pp. 57-75, (2012)
  • [7] Cash D., Hofheinz D., Kiltz E., Peikert C., Bonsai trees, or how to delegate a lattice basis, Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 523-552, (2010)
  • [8] Chaum E., David, Van Heyst, Group signatures, Workshop on the theory and application of of cryptographic techniques, pp. 257-265, (1991)
  • [9] Verifier-local revocation group signatures with time-bound keys. In: Proceedings of the 7th ACM symposium on information, computer and communications security, Pp 26–27, (2012)
  • [10] Emura K., Hayashi T., Ishida A., Group signatures with time-bound keys revisited: A new model and an efficient construction, Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, pp. 777-788, (2017)