{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:20:33Z","timestamp":1740169233387,"version":"3.37.3"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"CNPq - Brazilian National Research Council","award":["312180\/2019-5 PQ-2","465741\/2014-2 INCT on Cybersecurity"],"award-info":[{"award-number":["312180\/2019-5 PQ-2","465741\/2014-2 INCT on Cybersecurity"]}]},{"name":"Brazilian Ministry of the Economy","award":["DIPLA 005\/2016","ENAP 083\/2016"],"award-info":[{"award-number":["DIPLA 005\/2016","ENAP 083\/2016"]}]},{"name":"Administrative Council for Economic Defense","award":["CADE 08700.000047\/2019-14"],"award-info":[{"award-number":["CADE 08700.000047\/2019-14"]}]},{"DOI":"10.13039\/501100019826","name":"Advocacia-Geral da Uni\u00e3o","doi-asserted-by":"publisher","award":["AGU 697.935\/2019"],"award-info":[{"award-number":["AGU 697.935\/2019"]}],"id":[{"id":"10.13039\/501100019826","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Auditing Department of the Brazilian Health System SUS","award":["DENASUS 23106.118410\/2020-85"],"award-info":[{"award-number":["DENASUS 23106.118410\/2020-85"]}]},{"name":"General Attorney\u2019s Office for the National Treasure","award":["PGFN 23106.148934\/2019-67"],"award-info":[{"award-number":["PGFN 23106.148934\/2019-67"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3118959","type":"journal-article","created":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T22:57:43Z","timestamp":1633906663000},"page":"139928-139945","source":"Crossref","is-referenced-by-count":0,"title":["Information-Theoretically Secure String Commitments Based on Packet Reordering Channels"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7955-9859","authenticated-orcid":false,"given":"Vinicius","family":"de Morais Alves","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7588-2410","authenticated-orcid":false,"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1101-3029","authenticated-orcid":false,"given":"Rafael Timoteo","family":"de Sousa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8298-6250","authenticated-orcid":false,"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158898"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921856"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032814"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928990"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557524"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262082"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158487"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111750"},{"article-title":"Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer","year":"1999","author":"rivest","key":"ref60"},{"journal-title":"Concrete Mathematics A Foundation for Computer Science","year":"1994","author":"graham","key":"ref62"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2485270"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"ref1","first-page":"332","article-title":"Implementing information-theoretically secure oblivious transfer from packet reordering","author":"palmieri","year":"2011","journal-title":"Proc ICISC"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104471"},{"key":"ref22","first-page":"103","article-title":"On the possibility of universally composable commitments based on noisy channels","author":"dowsley","year":"2008","journal-title":"Proc Anais do 8th Simpósio Brasileiro em Segurança da Informação e de Sistemas Computacionais (SBSEG)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.83.1447"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3390\/e22010107"},{"key":"ref23","first-page":"509","article-title":"On the composability of statistically secure bit commitments","volume":"14","author":"dowsley","year":"2013","journal-title":"J Internet Technol"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2967048"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921686"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73009"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1080\/0025570X.1994.11996247"},{"key":"ref58","first-page":"1","article-title":"A generating function for numbers of insets","volume":"17","author":"janji?","year":"2014","journal-title":"J Integer Sequences"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2008.09.022"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743500"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513652"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_29"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/0217014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-2789(98)00053-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735423"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21920"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69053-0_21"},{"article-title":"Protocolo de comprometimento de bit eficiente com segurança sequencial baseado no modelo de memória limitada","year":"2010","author":"alves","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25516-8_8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2796128"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_10"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19571-6_11"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17470-9_12"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.47"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"ref6","first-page":"87","article-title":"Multiparty computations ensuring privacy of each party’s input and correctness of the result","volume":"293","author":"chaum","year":"1988","journal-title":"Adv Cryptology"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40974-8_4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.3414"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_23"},{"key":"ref45","first-page":"20","article-title":"Founding cryptography on oblivious transfer","author":"kilian","year":"1988","journal-title":"Proc STOC"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132531"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41383-4_11"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21518-6_10"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2006.05.035"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.042315"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09564062.pdf?arnumber=9564062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:54Z","timestamp":1639770954000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9564062\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3118959","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}