{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T00:08:07Z","timestamp":1769299687017,"version":"3.49.0"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ANR CBCRYPT"},{"name":"PEPR Quantique"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1109\/tit.2022.3168439","type":"journal-article","created":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T19:36:18Z","timestamp":1650483378000},"page":"6233-6244","source":"Crossref","is-referenced-by-count":8,"title":["Ouroboros: An Efficient and Provably Secure KEM Family"],"prefix":"10.1109","volume":"68","author":[{"given":"Nicolas","family":"Aragon","sequence":"first","affiliation":[{"name":"CNRS, Inria, IRISA, University of Rennes, Rennes, France"}]},{"given":"Olivier","family":"Blazy","sequence":"additional","affiliation":[{"name":"LIX, CNRS, Inria, École Polytechnique, Palaiseau, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5128-6729","authenticated-orcid":false,"given":"Jean-Christophe","family":"Deneuville","sequence":"additional","affiliation":[{"name":"ENAC, University of Toulouse, Toulouse, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4034-521X","authenticated-orcid":false,"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[{"name":"XLIM-MATHIS, University of Limoges, Limoges, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6041-9554","authenticated-orcid":false,"given":"Gilles","family":"Zemor","sequence":"additional","affiliation":[{"name":"IMB, University of Bordeaux, Bordeaux, France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2009.009"},{"key":"ref3","article-title":"Algebraic decoding of rank metric codes","volume-title":"Proc. YACC","author":"Levy-dit-Vehel"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6_2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054868"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref8","first-page":"1","article-title":"Low rank parity check codes and their application to cryptography","volume-title":"Proc. Workshop Coding Cryptography (WCC)","author":"Gaborit"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11554868_5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2804444"},{"key":"ref13","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","article-title":"Decoding one out of many","volume":"7071","author":"Sendrier","year":"2011","journal-title":"Post-Quantum Cryptography"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282956"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2511786"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616127"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29360-8_2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541522"},{"key":"ref21","volume-title":"Bike: Bit Flipping Key Encapsulation","author":"Aragon","year":"2017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2933535"},{"key":"ref24","article-title":"Post-quantum key exchange-a new hope","volume-title":"Proc. USENIX Secur. Symp.","author":"Alkim"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437940"},{"key":"ref26","article-title":"Ouroboros-R","author":"Melchor","year":"2017","journal-title":"First Round Submission to the NIST Post-Quantum Cryptography Call"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6_1"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9861208\/09760429.pdf?arnumber=9760429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:26:50Z","timestamp":1705958810000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9760429\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":27,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3168439","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}