Efficient Dynamic Group Signature Scheme with Verifier Local Revocation and Time-Bound Keys using Lattices
Keywords:Lattice based cryptography, dynamic group signatures, verifier local revocation, time bound keys
Revocation is an important feature of group signature schemes. Verifier Local Revocation (VLR) is a popular revocation mechanism which involves only verifiers in the revocation process. In VLR, a revocation list is maintained to store the information about revoked users. The verification cost of VLR based schemes is
linearly proportional to the size of recvocation list. In many applications, the size of revocation list grows with time, which makes the verification process expensive. In this paper, we propose a lattice based dynamic group signature using VLR and time bound keys to reduce the size of revocation list to speed up the verification process. In the proposed scheme, an expiration date is fixed for signing key of each group member, and verifiers can find out (at constant
cost) if a signature is generated using an expired key. Hence revocation information of members who are revoked before signing key expiry date (premature revocation) are kept in revocation list, and other members are part of natural revocation. This leads to a significant saving on the revocation check by assuming natural revocation accounts for large fraction of the total revocation. This scheme also takes care of non-forgeability of signing key expiry date.
E. Chaum, David & Van Heyst, Group signatures, in: Workshop on the Theory and Application of of Cryptographic Techniques, Springer, 1991, pp. 257–265.
M. Bellare, D. Micciancio, B. Warinschi, Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions, in: International conference on the theory and applications of cryptographic techniques, Springer, 2003, pp. 614–629.
M. Bellare, H. Shi, C. Zhang, Foundations of group signatures: The case of dynamic groups, in: Cryptographers’ Track at the RSA Conference, Springer, 2005, pp. 136–153.
A. Kiayias, M. Yung, Secure scalable group signature with dynamic joins and separable authorities, International Journal of Security and Networks 1 (1-2) (2006) 24–45.
D. Boneh, H. Shacham, Group signatures with verifier-local revocation, in: Proceedings of the 11th ACM conference on Computer and communications security, 2004, pp. 168–177.
A. Mehmood, I. Natgunanathan, Y. Xiang, H. Poston, Y. Zhang, Anonymous authentication scheme for smart cloud based healthcare applications, IEEE access 6 (2018) 33552–33567.
A. Sudarsono, M. U. H. Al Rasyid, An anonymous authentication system in wireless networks using verifier-local revocation group signature scheme, in: 2016 International Seminar on Intelligent Technology and Its Applications (ISITIA), IEEE, 2016, pp. 49–54.
H. Zheng, Q. Wu, B. Qin, L. Zhong, S. He, J. Liu, Linkable group signature for auditing anonymous communication, in: Australasian Conference on Information Security and Privacy, Springer, 2018, pp. 304–321.
J. Bringer, H. Chabanne, D. Pointcheval, S. Zimmer, An application of the boneh and shacham group signature scheme to biometric authentication, in: International Workshop on Security, Springer, 2008, pp. 219–230.
X. Lin, R. Lu, Gsis: group signature and id-based signature-based secure and privacy-preserving protocol (2015).
C.-K. Chu, J. K. Liu, X. Huang, J. Zhou, Verifier-local revocation group signatures with time-bound keys, in: Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, 2012, pp. 26–27.
M. Ajtai, Generating hard instances of lattice problems, in: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, 1996, pp. 99–108.
C. Gentry, C. Peikert, V. Vaikuntanathan, Trap-doors for hard lattices and new cryptographic constructions, in: Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, pp.197–206.
O. Regev, On lattices, learning with errors, random linear codes, and cryptography, Journal of the ACM (JACM) 56 (6) (2009) 1–40.
S. D. Gordon, J. Katz, V. Vaikuntanathan, A groupsignature scheme from lattice assumptions, in: International conference on the theory and application of cryptology and information security, Springer, 2010, pp. 395–412.
J. Camenisch, G. Neven, M. Rückert, Fully anonymous attribute tokens from lattices, in: International Conference on Security and Cryptography for Networks, Springer, 2012, pp. 57–75.
F. Laguillaumie, A. Langlois, B. Libert, D. Stehlé, Lattice-based group signatures with logarithmic signature size, in: International conference on the theory and application of cryptology and information security, Springer, 2013, pp. 41–61.
A. Langlois, S. Ling, K. Nguyen, H. Wang, Lattice based group signature scheme with verifier-local revocation, in: International workshop on public key cryptography, Springer, 2014, pp. 345–361.
P. Q. Nguyen, J. Zhang, Z. Zhang, Simpler efficient group signatures from lattices, in: IACR International Workshop on Public Key Cryptography, Springer, 2015, pp. 401–426.
Y. Zhang, Y. Hu, W. Gao, M. Jiang, Simpler efficient group signature scheme with verifier-local revocation from lattices, KSII Transactions on Internet and Information Systems (TIIS) 10 (1) (2016) 414–430.
M. N. S. Perera, T. Koshiba, Fully dynamic group signature scheme with member registration and verifier-local revocation, in: International conference on mathematics and computing, Springer, 2018, pp. 399–415.
B. Libert, S. Ling, F. Mouhartem, K. Nguyen, H. Wang, Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions, in: International Conference on the Theory and Application of Cryptology and Information Se-curity, Springer, 2016, pp. 373–403.
W. Gao, Y. Hu, Y. Zhang, B. Wang, Lattice-based group signature with verifier-local revocation, Journal of Shanghai Jiaotong University (Science) 22 (3) (2017) 313–321.
K. Emura, T. Hayashi, A. Ishida, Group signatures with time-bound keys revisited: A new model and an efficient construction, in: Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, 2017, pp. 777–788.
C. Peikert, A. Rosen, Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices, in: Theory of Cryptography Conference, Springer, 2006, pp. 145–166.
J. Alwen, C. Peikert, Generating shorter bases for hard random lattices, in: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, IBFI Schloss Dagstuhl, 2009, pp. 75–86.
D. Cash, D. Hofheinz, E. Kiltz, C. Peikert, Bonsai trees, or how to delegate a lattice basis, in: Annual international conference on the theory and applications of cryptographic techniques, Springer, 2010, pp. 523–552.
C. Peikert, A decade of lattice cryptography, Foundations and Trends® in Theoretical Computer Science 10 (4) (2016) 283–424.
Z. Brakerski, A. Langlois, C. Peikert, O. Regev, D. Stehle, Classical hardness of learning with errors, in: Proceedings of the forty-fifth annual ACM symposium on Theory of computing, 2013, pp. 575–584.
H.-Y. Lin, W.-G. Tzeng, An efficient solution to the millionaires’ problem based on homomorphic encryption, in: International Conference on Applied Cryptography and Network Security, Springer, 2005, pp. 456–466.
A. Fiat, A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, in: Conference on the theory and application of cryptographic techniques, Springer, 1986, pp. 186–194.
E. Brickell, D. Pointcheval, S. Vaudenay, M. Yung, Design validations for discrete logarithm based signature schemes, in: International Workshop on Public Key Cryptography, Springer, 2000, pp. 276–292.
B. Libert, F. Mouhartem, K. Nguyen, A lattice based group signature scheme with message dependent opening, in: International Conference on Applied Cryptography and Network Security, Springer, 2016, pp. 137–155.
How to Cite
Copyright (c) 2021 Abhilash M H, Amberker B B
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The articles published in International Journal of Computer and Information Technology (IJCIT) is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.