{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T13:26:55Z","timestamp":1762090015956,"version":"build-2065373602"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11704-023-2372-x","type":"journal-article","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T01:01:47Z","timestamp":1684890107000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["BSKCN and BSAML: blind signatures from the module lattice and the asymmetric module lattice"],"prefix":"10.1007","volume":"17","author":[{"given":"Xiaofan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim-Kwang Raymond","family":"Choo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,24]]},"reference":[{"issue":"2","key":"2372_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"P W Shor","year":"1999","unstructured":"Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review, 1999, 41(2): 303\u2013332","journal-title":"SIAM Review"},{"key":"2372_CR2","doi-asserted-by":"crossref","unstructured":"R\u00fcckert M. Lattice-based blind signatures. In: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security on Advances in Cryptology. 2010, 413\u2013430","DOI":"10.1007\/978-3-642-17373-8_24"},{"key":"2372_CR3","doi-asserted-by":"crossref","unstructured":"Juels A, Luby M, Ostrovsky R. Security of blind digital signatures. In: Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology. 1997, 150\u2013164","DOI":"10.1007\/BFb0052233"},{"issue":"1","key":"2372_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","volume":"2018","author":"L Ducas","year":"2018","unstructured":"Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schwabe P, Seiler G, Stehl\u00e9 D. Crystals-dilithium: a lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2018, 2018(1): 238\u2013268","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"2372_CR5","doi-asserted-by":"crossref","unstructured":"Le H Q, Susilo W, Khuc T X, Bui M K, Duong D H. A blind signature from module latices. In: Proceedings of 2019 IEEE Conference on Dependable and Secure Computing (DSC). 2019, 1\u20138","DOI":"10.1109\/DSC47296.2019.8937613"},{"key":"2372_CR6","doi-asserted-by":"crossref","unstructured":"Zhang J, Yu Y, Fan S, Zhang Z, Yang K. Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes. In: Proceedings of the 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography. 2020, 37\u201365","DOI":"10.1007\/978-3-030-45388-6_2"},{"key":"2372_CR7","doi-asserted-by":"crossref","unstructured":"Gong B, Cheng L, Zhao Y. SKCN: practical and flexible digital signature from module lattice. In: Proceedings of the 25th Australasian Conference on Information Security and Privacy. 2020, 62\u201381","DOI":"10.1007\/978-3-030-55304-3_4"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2372-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-023-2372-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2372-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T20:42:55Z","timestamp":1737232975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-023-2372-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,24]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["2372"],"URL":"https:\/\/doi.org\/10.1007\/s11704-023-2372-x","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"type":"print","value":"2095-2228"},{"type":"electronic","value":"2095-2236"}],"subject":[],"published":{"date-parts":[[2023,5,24]]},"assertion":[{"value":"21 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"176815"}}