共 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)