[1] |
CHAUM D,HEYST E.Group signatures[C]//Proceedings of Workshop on the Theory and Application of Cryptographic Techniques.Berlin,Germany:Springer,1991:257-265.
|
[2] |
SHOR P W.Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J].SIAM Review,1999,41(2):303-332.
|
[3] |
CAMENISCH J,STADLER M.Efficient group signature schemes for large groups[C]//Proceedings of Annual International Cryptology Conference.Berlin,Germany:Springer,1997:410-424.
|
[4] |
ATENIESE G,CAMENISCH J,JOYE M,et al.A practical and provably secure coalition-resistant group signature scheme[C]//Proceedings of Annual International Cryptology Conference.Berlin,Germany:Springer,2000:255-270.
|
[5] |
BONEH D,BOYEN X,SHACHAM H.Short group signatures[C]//Proceedings of Annual International Cryptology Conference.Berlin,Germany:Springer,2004:41-55.
|
[6] |
GORDON S D,KATZ J,VAIKUNTANATHAN V.A group signature scheme from lattice assumptions[C]//Proceedings of International Conference on the Theory and Application of Cryptology and Information Security.Berlin,Germany:Springer,2010:395-412.
|
[7] |
LAGUILLAUMIE F,LANGLOIS A,LIBERT B,et al.Lattice-based group signatures with logarithmic signature size[C]//Proceedings of International Conference on the Theory and Application of Cryptology and Information Security.Berlin,Germany:Springer,2013:41-61.
|
[8] |
NGUYEN P Q,ZHANG J,ZHANG Z.Simpler efficient group signatures from lattices[C]//Proceedings of IACR International Workshop on Public Key Cryptography.Berlin,Germany:Springer,2015:401-426.
|
[9] |
BRESSON E,STERN J.Efficient revocation in group signatures[C]//Proceedings of International Workshop on Public Key Cryptography.Berlin,Germany:Springer,2001:190-206.
|
[10] |
ZHANG Yanhua,HU Yupu,GAO Wen,et al.Simpler efficient group signature scheme with verifier-local revocation from lattices[J].KSII Transactions on Internet & Information Systems,2016,10(1):414-430.
|
[11] |
LIBERT B,LING S,MOUHARTEM F,et al.Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions[C]//Proceedings of the 22nd International Conference on the Theory and Application of Cryptology and Information Security.Berlin,Germany:Springer,2016:373-403.
|
[12] |
LING S,NGUYEN K,WANG H,et al.Lattice-based group signatures:achieving full dynamicity with ease[C]//Proceedings of International Conference on Applied Cryptography and Network Security.Berlin,Germany:Springer,2017:293-312.
|
[13] |
LING S,NGUYEN K,ROUX-LANGLOIS A,et al.A lattice-based group signature scheme with verifier-local revocation[J].Theoretical Computer Science,2018,730:1-20.
|
[14] |
LI Xuelian,LÜ Xiaolin,GUO Lijuan,et al.A dynamic group signature scheme based on lattice for large group[J].Journal of University of Electronic Science and Technology of China,2019,48(1):80-87.(in Chinese)李雪莲,吕晓琳,郭利娟,等.适合大群组的格基动态群签名方案[J].电子科技大学学报,2019,48(1):80-87.
|
[15] |
ALWEN J,PEIKERT C.Generating shorter bases for hard random lattices[J].Theory of Computing Systems,2011,48(3):535-553.
|
[16] |
CASH D,HOFHEINZ D,KILTZ E,et al.Bonsai trees,or how to delegate a lattice basis[C]//Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2010:523-552.
|
[17] |
GENTRY C,PEIKERT C,VAIKUNTANATHAN V.Trapdoors for hard lattices and new cryptographic constructions[C]//Proceedings of the 40th Annual ACM Symposium on Theory of Computing.New York,USA:ACM Press,2008:197-206.
|
[18] |
MICCIANCIO D,MOL P.Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions[C]//Proceedings of Annual Cryptology Conference.Berlin,Germany:Springer,2011:465-484.
|
[19] |
BELLARE M,MICCIANCIO D,WARINSCHI B.Foundations of group signatures:formal definitions,simplified requirements,and a construction based on general assumptions[C]//Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2003:614-629.
|
[20] |
BOOTLE J,CERULLI A,CHAIDOS P,et al.Foundations of fully dynamic group signatures[C]//Proceedings of International Conference on Applied Cryptography and Network Security.Berlin,Germany:Springer,2016:117-136.
|
[21] |
BELLARE M,NEVEN G.Multi-signatures in the plain public-key model and a general forking lemma[C]//Proceedings of the 13th ACM Conference on Computer and Communications Security.New York,USA:ACM Press,2006:390-399.
|