{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:20:13Z","timestamp":1771698013529,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":45,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819788002","type":"print"},{"value":"9789819788019","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T00:00:00Z","timestamp":1735084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T00:00:00Z","timestamp":1735084800000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-97-8801-9_11","type":"book-chapter","created":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T07:05:52Z","timestamp":1735023952000},"page":"211-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Identity-Based Signature from\u00a0Lattices Without Trapdoors"],"prefix":"10.1007","author":[{"given":"Pingbin","family":"Luo","sequence":"first","affiliation":[]},{"given":"Xinjian","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[]},{"given":"Qiong","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,25]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A Shamir","year":"1985","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47\u201353. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_5"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 197\u2013206, New York, NY, USA (2008). Association for Computing Machinery","DOI":"10.1145\/1374376.1374407"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-12929-2_14","volume-title":"Post-Quantum Cryptography","author":"M R\u00fcckert","year":"2010","unstructured":"R\u00fcckert, M.: Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 182\u2013200. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_14"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/sec.531","volume":"6","author":"Z Liu","year":"2013","unstructured":"Liu, Z., Yupu, H., Zhang, X., Li, F.: Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model. Secur. Commun. Netw. 6(1), 69\u201377 (2013)","journal-title":"Secur. Commun. Netw."},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJESDF.2013.054403","volume":"5","author":"M Tian","year":"2013","unstructured":"Tian, M., Huang, L., Yang, W.: Efficient hierarchical identity-based signatures from lattices. Int. J. Electron. Secur. Digit. Forensics 5(1), 1\u201310 (2013). PMID: 54403","journal-title":"Int. J. Electron. Secur. Digit. Forensics"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-10366-7_35","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"V Lyubashevsky","year":"2009","unstructured":"Lyubashevsky, V.: Fiat-shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 598\u2013616. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"11_CR8","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-55415-5_26","volume-title":"ICT Systems Security and Privacy Protection","author":"M Tian","year":"2014","unstructured":"Tian, M., Huang, L.: Efficient identity-based signature from lattices. In: Cuppens-Boulahia, N., Cuppens, F., Jajodia, S., Abou El Kalam, A., Sans, T. (eds.) SEC 2014. IAICT, vol. 428, pp. 321\u2013329. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55415-5_26"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-662-45608-8_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"L Ducas","year":"2014","unstructured":"Ducas, L., Lyubashevsky, V., Prest, T.: Efficient identity-based encryption over NTRU lattices. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 22\u201341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_2"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1631\/FITEE.1500197","volume":"17","author":"J Xie","year":"2016","unstructured":"Xie, J., Yu-pu, H., Gao, J., Gao, W.: Efficient identity-based signature over NTRU lattice. Front. Inf. Technol. Electron. Eng. 17(2), 135\u2013142 (2016)","journal-title":"Front. Inf. Technol. Electron. Eng."},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1631\/FITEE.1900318","volume":"22","author":"J Chen","year":"2021","unstructured":"Chen, J., Yu-pu, H., Liang, H., Gao, W.: Novel efficient identity-based signature on lattices. Front. Inf. Technol. Electron. Eng. 22(2), 244\u2013250 (2021)","journal-title":"Front. Inf. Technol. Electron. Eng."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-030-81293-5_19","volume-title":"Post-Quantum Cryptography","author":"J Pan","year":"2021","unstructured":"Pan, J., Wagner, B.: Short identity-based signatures with tight security from lattices. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 360\u2013379. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_19"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Foo, E., Li, Q.: Tightly secure lattice identity-based signature in the quantum random oracle model. In: Simpson, L., Rezazadeh Baee, M.A. (eds.) Information Security and Privacy, pp. 381\u2013402. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35486-1_17","DOI":"10.1007\/978-3-031-35486-1_17"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Sageloli, \u00c9., P\u00e9bereau, P., M\u00e9aux, P., Chevalier, C.: Shorter and faster identity-based signatures with tight security in the (Q)ROM from lattices. In: Tibouchi, M., Wang, X. (eds.) Applied Cryptography and Network Security, pp. 634\u2013663. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33488-7_24","DOI":"10.1007\/978-3-031-33488-7_24"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2022.08.022","volume":"933","author":"X Chen","year":"2022","unstructured":"Chen, X., Huang, Q., Li, H., Liao, Z., Susilo, W.: A novel identity-based multi-signature scheme over NTRU lattices. Theoret. Comput. Sci. 933, 163\u2013176 (2022)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1007\/s12083-023-01474-0","volume":"16","author":"J Liang","year":"2023","unstructured":"Liang, J., Huang, Q., Huang, J., Lan, L., Au, M.H.A.: An identity-based traceable ring signatures based on lattice. Peer-to-Peer Netw. Appl. 16(2), 1270\u20131285 (2023)","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"11_CR17","unstructured":"Prest, T., et al.: FALCON. Post-Quantum Cryptography Project of NIST, Gregor Seiler (2020)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Ducas, L. and Prest, T.: Fast fourier orthogonalization. In: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, pp. 191\u2013198, New York, NY, USA (2016). Association for Computing Machinery","DOI":"10.1145\/2930889.2930923"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Espitau, T., et al.: MITAKA: a simpler, parallelizable, maskable variant of FALCON. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022, pp. 222\u2013253. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_9","DOI":"10.1007\/978-3-031-07082-2_9"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Espitau, T., Nguyen, T.T.Q., Sun, C., Tibouchi, M., Wallet, A.: ANTRAG: annular NTRU Trapdoor Generation. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2023, pp. 3\u201336. Springer, Singapor (2023).. https:\/\/doi.org\/10.1007\/978-981-99-8739-9_1","DOI":"10.1007\/978-981-99-8739-9_1"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Chuengsatiansup, C., Prest, T., Stehl\u00e9, D., Wallet, A. and Xagawa, K.: ModFalcon: compact signatures based on module-NTRU lattices. In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security, ASIA CCS 2020, pp. 853\u2013866, New York, NY, USA (2020). Association for Computing Machinery","DOI":"10.1145\/3320269.3384758"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-56620-7_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"P Kirchner","year":"2017","unstructured":"Kirchner, P., Fouque, P.-A.: Revisiting lattice attacks on overstretched NTRU parameters. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 3\u201326. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_1"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92068-5_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"L Ducas","year":"2021","unstructured":"Ducas, L., van Woerden, W.: NTRU Fatigue: How Stretched is Overstretched? In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 3\u201332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_1"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: CRYSTALS - Kyber: A CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 353\u2013367 (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"issue":"1","key":"11_CR25","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., et al.: Crystals-dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptogr. Hardware Embed. Syst. 2018(1), 238\u2013268 (2018)","journal-title":"IACR Trans. Cryptogr. Hardware Embed. Syst."},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Crypt."},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-81293-5_11","volume-title":"Post-Quantum Cryptography","author":"P Bert","year":"2021","unstructured":"Bert, P., Eberhart, G., Prabel, L., Roux-Langlois, A., Sabt, M.: Implementation of lattice trapdoors on modules and applications. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 195\u2013214. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_11"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Yu, Y., Jia, H., Wang, X.: Compact lattice gadget and its applications to hash-and-sign signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023, pp. 390\u2013420. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_13","DOI":"10.1007\/978-3-031-38554-4_13"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-030-44223-1_4","volume-title":"Post-Quantum Cryptography","author":"J Howe","year":"2020","unstructured":"Howe, J., Prest, T., Ricosset, T., Rossi, M.: Isochronous Gaussian sampling: from\u00a0inception to implementation. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 53\u201371. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_4"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"L Ducas","year":"2013","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal gaussians. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 40\u201356. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_3"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Pessl, P., Bruinderink, L.G. and Yarom, Y.: To BLISS-B or not to be: attacking strongswan\u2019s implementation of post-quantum signatures. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 1843\u20131855, New York, NY, USA (2017). Association for Computing Machinery","DOI":"10.1145\/3133956.3134023"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-02384-2_9","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"D Galindo","year":"2009","unstructured":"Galindo, D., Garcia, F.D.: A schnorr-like lightweight identity-based signature scheme. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 135\u2013148. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02384-2_9"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-37682-5_32","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"S Chatterjee","year":"2013","unstructured":"Chatterjee, S., Kamath, C., Kumar, V.: Galindo-garcia identity-based signature revisited. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 456\u2013471. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_32"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-04852-9_2","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"S Bai","year":"2014","unstructured":"Bai, S., Galbraith, S.D.: An improved compression technique for signatures based on learning with errors. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 28\u201347. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04852-9_2"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-33027-8_31","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"T G\u00fcneysu","year":"2012","unstructured":"G\u00fcneysu, T., Lyubashevsky, V., P\u00f6ppelmann, T.: Practical lattice-based cryptography: a signature scheme for embedded systems. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 530\u2013547. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_31"},{"key":"11_CR37","unstructured":"Cheon, J.H., et al.: Shorter lattice-based fiat-shamir signatures. Cryptology ePrint Archive, Paper 2023\/624 (2023). https:\/\/eprint.iacr.org\/2023\/624"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Julien Devevey, Alain Passel\u00e8gue, and Damien Stehl\u00e9. G+g: A fiat-shamir lattice signature based on convolved gaussians. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2023, pp. 37\u201364. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_2","DOI":"10.1007\/978-981-99-8739-9_2"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, pp. 390\u2013399, New York, NY, USA, 2006. Association for Computing Machinery","DOI":"10.1145\/1180405.1180453"},{"key":"11_CR40","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00145-010-9082-x","volume":"25","author":"A Boldyreva","year":"2012","unstructured":"Boldyreva, A., Palacio, A., Warinschi, B.: Secure proxy signature schemes for delegation of signing rights. J. Cryptol. 25, 57\u2013115 (2012)","journal-title":"J. Cryptol."},{"key":"11_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-319-78372-7_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"E Kiltz","year":"2018","unstructured":"Kiltz, E., Lyubashevsky, V., Schaffner, C.: A concrete treatment of fiat-shamir signatures in the quantum random-oracle model. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 552\u2013586. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_18"},{"key":"11_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-030-26951-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Zhandry, M.: Revisiting post-quantum fiat-shamir. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 326\u2013355. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_12"},{"key":"11_CR43","doi-asserted-by":"publisher","unstructured":"Devevey, J., Fallahpour, P., Passel\u00e8gue, A., Stehl\u00e9, D.: A detailed analysis of fiat-shamir with aborts. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023, pp. 327\u2013357. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_11","DOI":"10.1007\/978-3-031-38554-4_11"},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N. and Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pp. 10\u201324. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"11_CR45","unstructured":"Laarhoven, T.: Search problems in cryptography: from fingerprinting to lattice sieving. PhD thesis, Mathematics and Computer Science, February 2016. Proefschrift"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-8801-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T08:04:22Z","timestamp":1735027462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-8801-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,25]]},"ISBN":["9789819788002","9789819788019"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-8801-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,25]]},"assertion":[{"value":"25 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mytilene","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icics2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icics2024.aegean.gr","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}