{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,5]],"date-time":"2026-09-05T16:42:01Z","timestamp":1788626521597,"version":"build-2803163510"},"reference-count":16,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2020]]},"DOI":"10.3934\/amc.2020027","type":"journal-article","created":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T04:42:21Z","timestamp":1568263341000},"page":"535-553","source":"Crossref","is-referenced-by-count":7,"title":["Group signature from lattices preserving forward security in dynamic setting"],"prefix":"10.3934","volume":"14","author":[{"given":"Meenakshi","family":"Kansal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ratna","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sourav","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020027-1","doi-asserted-by":"crossref","unstructured":"

S. Agrawal, D. Boneh and X. Boyen, Efficient lattice (H)IBE in the standard model, in Advances in cryptology\u2014EUROCRYPT 2010<\/i>, Lecture Notes in Comput. Sci., Springer, Berlin, 6110<\/b> (2010), 553\u2013572.<\/p>","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"key-10.3934\/amc.2020027-2","doi-asserted-by":"crossref","unstructured":"

M. Ajtai, Generating hard instances of lattice problems (extended abstract), in Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing<\/i>, ACM, New York, (1996), 99\u2013108.<\/p>","DOI":"10.1145\/237814.237838"},{"key":"key-10.3934\/amc.2020027-3","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9278-3"},{"key":"key-10.3934\/amc.2020027-4","doi-asserted-by":"crossref","unstructured":"

E. Brickell, D. Pointcheval, S. Vaudenay and M. Yung, Design validations for discrete logarithm based signature schemes, in Public Key Cryptography<\/i>, Lecture Notes in Comput. Sci., Springer, Berlin, 1751<\/b> (2000), 276\u2013292.<\/p>","DOI":"10.1007\/978-3-540-46588-1_19"},{"key":"key-10.3934\/amc.2020027-5","doi-asserted-by":"crossref","unstructured":"

J. Camenisch, G. Neven and M. R\u00fcckert, Fully anonymous attribute tokens from lattices, in International Conference on Security and Cryptography for Networks<\/i>, Springer, 2012, 57\u201375.<\/p>","DOI":"10.1007\/978-3-642-32928-9_4"},{"key":"key-10.3934\/amc.2020027-6","doi-asserted-by":"crossref","unstructured":"

D. Cash, D. Hofheinz, E. Kiltz and C. Peikert, Bonsai trees, or how to delegate a lattice basis, in Advances in cryptology\u2014EUROCRYPT 2010<\/i>, Lecture Notes in Comput. Sci., Springer, Berlin, 6110<\/b> (2010), 523\u2013552.<\/p>","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"key-10.3934\/amc.2020027-7","doi-asserted-by":"crossref","unstructured":"

C. Gentry, C. Peikert and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in STOC'08<\/i>, ACM, New York, (2008), 197\u2013206.<\/p>","DOI":"10.1145\/1374376.1374407"},{"key":"key-10.3934\/amc.2020027-8","doi-asserted-by":"crossref","unstructured":"

S. D. Gordon, J. Katz and V. Vaikuntanathan, A group signature scheme from lattice assumptions, in Advances in cryptology\u2014ASIACRYPT 2010<\/i>, Lecture Notes in Comput. Sci., Springer, Berlin, 6477<\/b> (2010), 395\u2013412.<\/p>","DOI":"10.1007\/978-3-642-17373-8_23"},{"key":"key-10.3934\/amc.2020027-9","unstructured":"

U. Hohenberger, Honest verifier zk and fiat-shamir (lecture 1), (2007), https:\/\/www.cs.jhu.edu\/susan\/600.641\/scribes\/lecture11.pdf<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020027-10","doi-asserted-by":"crossref","unstructured":"

F. Laguillaumie, A. Langlois, B. Libert and D. Stehl\u00e9, Lattice-based group signatures with logarithmic signature size, in Advances in cryptology\u2014ASIACRYPT 2013. Part \u2161<\/i>, Lecture Notes in Comput. Sci., Springer, Heidelberg, 8270<\/b> (2013), 41\u201361.<\/p>","DOI":"10.1007\/978-3-642-42045-0_3"},{"key":"key-10.3934\/amc.2020027-11","doi-asserted-by":"crossref","unstructured":"

B. Libert, S. Ling, F. Mouhartem, K. Nguyen and H. X. Wang, Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions, in Advances in Cryptology\u2014ASIACRYPT 2016. Part \u2161<\/i>, Lecture Notes in Comput. Sci., Springer, Berlin, 10032<\/b> (2016), 373\u2013403.<\/p>","DOI":"10.1007\/978-3-662-53890-6_13"},{"key":"key-10.3934\/amc.2020027-12","doi-asserted-by":"crossref","unstructured":"

B. Libert and M. Yung, Fully forward-secure group signatures, in Cryptography and Security: From Theory to Applications<\/i>, Springer, (2012), 156\u2013184.<\/p>","DOI":"10.1007\/978-3-642-28368-0_13"},{"key":"key-10.3934\/amc.2020027-13","doi-asserted-by":"crossref","unstructured":"

S. Ling, K. Nguyen, D. Stehl\u00e9 and H. X. Wang, Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications, in Public Key Cryptography\u2014PKC 2013<\/i>, Lecture Notes in Comput. Sci., Springer, Heidelberg, 7778<\/b> (2013), 107\u2013124.<\/p>","DOI":"10.1007\/978-3-642-36362-7_8"},{"key":"key-10.3934\/amc.2020027-14","doi-asserted-by":"crossref","unstructured":"

S. Ling, K. Nguyen and H. X. Wang, Group signatures from lattices: simpler, tighter, shorter, ring-based, in Public-key Cryptography\u2014PKC 2015<\/i>, Lecture Notes in Comput. Sci., Springer, Heidelberg, 9020<\/b> (2015), 427\u2013449.<\/p>","DOI":"10.1007\/978-3-662-46447-2_19"},{"key":"key-10.3934\/amc.2020027-15","doi-asserted-by":"crossref","unstructured":"

S. Ling, K. Nguyen, H. X. Wang and Y. H. Xu, Forward-secure group signatures from lattices, International Conference on Post-Quantum Cryptography<\/i>, 11505<\/b> (2019), 44\u201364, arXiv: 1801.08323.<\/p>","DOI":"10.1007\/978-3-030-25510-7_3"},{"key":"key-10.3934\/amc.2020027-16","doi-asserted-by":"crossref","unstructured":"

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, Journal of the ACM (JACM)<\/i>, 56<\/b> (2009), Art. 34, 40 pp.<\/p>","DOI":"10.1145\/1568318.1568324"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=4eefeadc-e063-4e8f-aeef-d5af22aad7c6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:29Z","timestamp":1772791529000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2020027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2020027","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}