{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T03:42:27Z","timestamp":1730259747684,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/icton.2019.8840386","type":"proceedings-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:44:47Z","timestamp":1568940287000},"page":"1-4","source":"Crossref","is-referenced-by-count":3,"title":["On minimal assumptions to obtain a universally composable quantum bit commitment"],"prefix":"10.1109","author":[{"given":"M.","family":"Lemus","sequence":"first","affiliation":[]},{"given":"P.","family":"Yadav","sequence":"additional","affiliation":[]},{"given":"P.","family":"Mateus","sequence":"additional","affiliation":[]},{"given":"N.","family":"Paunkovic","sequence":"additional","affiliation":[]},{"given":"A.","family":"Souto","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225085"},{"key":"ref10","first-page":"103","article-title":"On possibility of universally composable commitments based on noisy channels","author":"dowsley","year":"2008","journal-title":"Anais do VIII Simpósio Brasileiro em Segurança da Informaçao e de Sistemas Computacionais SBSEG"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382781"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.3410"},{"key":"ref2","first-page":"92861c","article-title":"A brief review on quantum bit commitment","volume":"9286","author":"almeida","year":"2014"},{"key":"ref9","first-page":"509","article-title":"On the composability of statistically secure bit commitments","volume":"14","author":"dowsley","year":"2013","journal-title":"Journal of Internet Technology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"}],"event":{"name":"2019 21st International Conference on Transparent Optical Networks (ICTON)","start":{"date-parts":[[2019,7,9]]},"location":"Angers, France","end":{"date-parts":[[2019,7,13]]}},"container-title":["2019 21st International Conference on Transparent Optical Networks (ICTON)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827188\/8839988\/08840386.pdf?arnumber=8840386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:10:27Z","timestamp":1657854627000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8840386\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/icton.2019.8840386","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}