{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:41:07Z","timestamp":1742949667800,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030692544"},{"type":"electronic","value":"9783030692551"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-69255-1_11","type":"book-chapter","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T22:04:45Z","timestamp":1612389885000},"page":"165-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An IND-CCA2 Attack Against the 1st- and 2nd-Round Versions of NTS-KEM"],"prefix":"10.1007","author":[{"given":"Tung","family":"Chou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,4]]},"reference":[{"key":"11_CR1","unstructured":"Albrecht, M., Cid, C., Paterson, K.G., Tjhai, C.J., Tomlinson, M.: NTS-KEM, first round submission (2017). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/NTS_KEM.zip. Citations in this document: \u00a71"},{"key":"11_CR2","unstructured":"Albrecht, M., Cid, C., Paterson, K.G., Tjhai, C.J., Tomlinson, M.: NTS-KEM, second round submission (2019). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-2\/submissions\/NTS-KEM-Round2.zip. Citations in this document: \u00a71"},{"key":"11_CR3","unstructured":"Albrecht, M., Cid, C., Paterson, K.G., Tjhai, C.J., Tomlinson, M.: NTS-KEM, updated second round submission (2019). https:\/\/nts-kem.io\/. Citations in this document: \u00a71"},{"key":"11_CR4","unstructured":"Berlekamp, E.R.: Algebraic coding theory, McGraw-Hill. MR 38 #6873. Citations in this document: \u00a73.5, \u00a73.6 (1968)"},{"key":"11_CR5","unstructured":"Albrecht, M., et al.: Classic McEliece (2020). https:\/\/classic.mceliece.org\/. Citations in this document: \u00a71, \u00a71.2"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Bertoni, G., Coron, J.-S. (eds.): CHES 2013. LNCS, vol. 8086. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1","DOI":"10.1007\/978-3-642-40349-1"},{"key":"11_CR7","unstructured":"Cho, J.Y.: Implementation of code-based KEMs submitted to NIST on optical communication systems (2019). https:\/\/cbc2019.dii.univpm.it\/program. Citations in this document: \u00a71.1"},{"key":"11_CR8","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack (2001). https:\/\/eprint.iacr.org\/2001\/108"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-40974-8_12","volume-title":"Cryptography and Coding","author":"AW Dent","year":"2003","unstructured":"Dent, A.W.: A Designer\u2019s Guide to KEMs. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 133\u2013151. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40974-8_12"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure Integration of Asymmetric and Symmetric Encryption Schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s00145-011-9114-1","volume":"26","author":"E Fujisaki","year":"2013","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. J. Cryptol. 26, 80\u2013101 (2013)","journal-title":"J. Cryptol."},{"key":"11_CR12","unstructured":"Helgert, H.: Decoding of alternant codes (Corresp.). IEEE Trans. Inf. Theory 23(4), 513\u2013514 (1977) Citations in this document: \u00a73.6"},{"key":"11_CR13","unstructured":"Maram, V.: On the security of NTS-KEM in the quantum random oracle model. In PQCRYPTO 2020 (to appear), p. 150 (2017). https:\/\/eprint.iacr.org\/2020\/150.pdf. Citations in this document: \u00a71, \u00a71, \u00a71.1"},{"key":"11_CR14","unstructured":"Massey, J.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15, 122\u2013127 (1969) Citations in this document: \u00a73.5, \u00a73.6, \u00a7 C"},{"key":"11_CR15","unstructured":"McEliece, R.J: A public-key cryptosystem based on algebraic. Coding Thv, 4244, 114\u2013116 (1978). http:\/\/ipnpr.jpl.nasa.gov\/progress_report2\/42-44\/44N.PDF. Citations in this document: \u00a72.5"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Paterson, K.G. (ed.): Cryptography and Coding 2003. LNCS, vol. 2898. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/b93924","DOI":"10.1007\/b93924"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Preneel, B. (ed.): EUROCRYPT 2000. LNCS, vol. 1807. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6","DOI":"10.1007\/3-540-45539-6"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-45539-6_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: A Composition Theorem for Universal One-Way Hash Functions. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 445\u2013452. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_32"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Wiener, M. (ed.): CRYPTO 1999. LNCS, vol. 1666. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1","DOI":"10.1007\/3-540-48405-1"},{"key":"11_CR20","unstructured":"Youzhi, X.: Implementation of Berlekamp-Massey algorithm without inversion. IEE Proc. I - Commun. Speech Vis. 138, 138\u2013140 (1991) Citations in this document: \u00a73.6, \u00a73.6"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69255-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T22:14:23Z","timestamp":1612390463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69255-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030692544","9783030692551"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69255-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 February 2021","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.secitc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers  as full papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}