{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T19:55:30Z","timestamp":1764014130422,"version":"3.45.0"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,29]]},"DOI":"10.1109\/itw62417.2025.11240496","type":"proceedings-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T18:39:40Z","timestamp":1763750380000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Hybrid Key Exchange Mechanism"],"prefix":"10.1109","author":[{"given":"Benjamin D.","family":"Kim","sequence":"first","affiliation":[{"name":"University of Illinois Urbana-Champaign,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipindev","family":"Adat Vasudevan","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Cohen","sequence":"additional","affiliation":[{"name":"ECE,Technion,Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael G. L.","family":"D\u2019Oliveira","sequence":"additional","affiliation":[{"name":"Clemson University,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Stahlbuhk","sequence":"additional","affiliation":[{"name":"MIT Lincoln Laboratory,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muriel","family":"M\u00e9dard","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-44"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010756"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539795293172"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3591866.3593072"},{"article-title":"CRYSTALS-Kyber: Algorithm Specifications and Supporting Documentation","volume-title":"2022, NIST PQC Round 3 finalist, now standardized","author":"Avanzi","key":"ref6"},{"key":"ref7","article-title":"Classic McEliece: Submission and Documentation","volume-title":"NIST PQC Round 4 alternate finalist","author":"Bernstein","year":"2022"},{"key":"ref8","article-title":"BIKE: Bit Flipping Key Encapsulation","volume-title":"NIST PQC Round 4 alternate finalist","author":"Barreto","year":"2022"},{"article-title":"HQC: Hamming Quasi-Cyclic Key Encapsulation Mechanism","volume-title":"2022, NIST PQC Round 4 alternate finalist","author":"Gaborit","key":"ref9"},{"article-title":"SIKE\u2013Supersingular Isogeny Key Encapsulation","year":"2022","author":"J","key":"ref10"},{"issue":"975","key":"ref11","article-title":"An efficient key recovery attack on SIDH","volume-title":"Cryptology ePrint Archive","author":"Castryck","year":"2022"},{"key":"ref12","article-title":"Hybrid PQ\/T Key Encapsulation Mechanisms","volume-title":"Internet Engineering Task Force, Internet-Draft draft-irtf-cfrg-hybrid-kems-03","author":"Connolly","year":"2025"},{"journal-title":"Tech. Rep. Federal Information Processing Standards Publications (FIPS) 203","article-title":"Module-lattice-based key-encapsulation mechanism standard","year":"2024","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76578-5_7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056621"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055721"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2282673"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970867"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282675"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248979"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2566260"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421192"},{"key":"ref23","first-page":"350","article-title":"On secure communication over the multiple access channel","volume-title":"2016 Int. Symp. on Inf. Theory and Its Applications (ISITA)","author":"Chen"},{"key":"ref24","article-title":"Weakly secure network coding","volume":"104","author":"Bhattad","year":"2005","journal-title":"NetCod, Apr"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158587"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2870831"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557282"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2704110"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2023.3307906"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3267664"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2014.6892130"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028489"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICUMT.2016.7765364"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/IWCMC.2018.8450399"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2947248"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3054598"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834772"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF00203965"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_1"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_14"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39200-9_31"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_30"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.08.009"}],"event":{"name":"2025 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2025,9,29]]},"location":"Sydney, Australia","end":{"date-parts":[[2025,10,3]]}},"container-title":["2025 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11240243\/11240249\/11240496.pdf?arnumber=11240496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T18:56:25Z","timestamp":1764010585000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11240496\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/itw62417.2025.11240496","relation":{},"subject":[],"published":{"date-parts":[[2025,9,29]]}}}