{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:14:57Z","timestamp":1778109297630,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032174420","type":"print"},{"value":"9783032174437","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-17443-7_8","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T22:51:16Z","timestamp":1778107876000},"page":"132-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DILISAES: An Experimental Lattice-Based Post-quantum Signcryption Scheme"],"prefix":"10.1007","author":[{"given":"Rownak","family":"Borhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzo","family":"Taenaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youki","family":"Kadobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process (2022)","DOI":"10.6028\/NIST.IR.8413-upd1"},{"key":"8_CR2","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Keccak sponge function family main document. Submission to NIST (Round 2) 3(30), 320\u2013337 (2009)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-21554-4_13","volume-title":"Applied Cryptography and Network Security","author":"D Chiba","year":"2011","unstructured":"Chiba, D., Matsuda, T., Schuldt, J.C.N., Matsuura, K.: Efficient generic constructions of signcryption with insider security in the multi-user setting. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 220\u2013237. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21554-4_13"},{"key":"8_CR4","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: Crystals\u2013Dilithium: digital signatures from module lattices (2018)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Dworkin, M.J.: SP 800-38d. recommendation for block cipher modes of operation: Galois\/counter mode (GCM) and GMAC. National Institute of Standards & Technology (2007)","DOI":"10.6028\/NIST.SP.800-38d"},{"key":"8_CR6","unstructured":"Dworkin, M.J., et al.: SHA-3 standard: permutation-based hash and extendable-output functions (2015)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-030-00434-7_15","volume-title":"Cryptology and Network Security","author":"F G\u00e9rard","year":"2018","unstructured":"G\u00e9rard, F., Merckx, K.: SETLA: signature and encryption from lattices. In: Camenisch, J., Papadimitratos, P. (eds.) CANS 2018. LNCS, vol. 11124, pp. 299\u2013320. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00434-7_15"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Le, H.Q., Duong, D.H., Roy, P.S., Susilo, W., Fukushima, K., Kiyomoto, S: Lattice-based signcryption with equality test in standard model. Comput. Standards Interfaces 76, 103515 (2021)","DOI":"10.1016\/j.csi.2021.103515"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Li, F., Bin Muhaya, F.T., Khan, M.K., Takagi, T.: Lattice-based signcryption. Concurr. Comput. Pract. Exp. 25(14), 2112\u20132122 (2013)","DOI":"10.1002\/cpe.2826"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-24632-9_14","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"B Libert","year":"2004","unstructured":"Libert, B., Quisquater, J.-J.: Efficient signcryption with key privacy from gap Diffie-Hellman groups. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 187\u2013200. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24632-9_14"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s11704-014-3163-1","volume":"8","author":"X Lu","year":"2014","unstructured":"Lu, X., Wen, Q., Jin, Z., Wang, L., Yang, C.: A lattice-based signcryption scheme without random oracles. Front. Comput. Sci. 8(4), 667\u2013675 (2014)","journal-title":"Front. Comput. Sci."},{"key":"8_CR12","unstructured":"Meet Willow, our state-of-the-art quantum chip \u2013 blog.google. https:\/\/blog.google\/technology\/research\/google-willow-quantum-chip\/. Accessed 22 Sep 2025"},{"key":"8_CR13","unstructured":"Microsoft Quantum | Topological qubits \u2013 quantum.microsoft.com. https:\/\/quantum.microsoft.com\/en- us\/insights\/education\/concepts\/topological-qubits. Accessed 22 Sep 2025"},{"key":"8_CR14","unstructured":"National Institute of Standards and Technology: PQC standardization process: announcing four candidates to be standardized, plus fourth round candidates | NIST (2022). https:\/\/www.nist.gov\/news-events\/news\/2022\/07\/pqc-standardization-process-announcing-four-candidates-be-standardized-plus#standardization. Accessed 08 Oct 2025"},{"key":"8_CR15","unstructured":"SABER: Mod-LWR based KEM (round 3 submission). Submission to the NIST\u2019s post-quantum cryptography standardization process. https:\/\/www.esat.kuleuven.be\/cosic\/pqcrypto\/saber\/. Accessed 7 Nov 2025"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-79063-3_16","volume-title":"Post-Quantum Cryptography","author":"S Sato","year":"2018","unstructured":"Sato, S., Shikata, J.: Lattice-based signcryption without random oracles. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 331\u2013351. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_16"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Yan, J., Wang, L., Wang, L., Yang, Y., Yao, W.: Efficient lattice-based signcryption in standard model. Math. Probl. Eng. 2013(1), 702539 (2013)","DOI":"10.1155\/2013\/702539"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Zheng, Y.: Digital signcryption or how to achieve cost (signature & encryption)\u00abcost (signature)+ cost (encryption). In: Annual International Cryptology Conference, pp. 165\u2013179. Springer (1997). https:\/\/doi.org\/10.1007\/bfb0052234","DOI":"10.1007\/bfb0052234"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17443-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T22:51:18Z","timestamp":1778107878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17443-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032174420","9783032174437"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17443-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecITC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Technology and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/secitc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}