{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:32:04Z","timestamp":1729657924868,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523644","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"1745-1748","source":"Crossref","is-referenced-by-count":17,"title":["Oblivious transfer and quantum non-locality"],"prefix":"10.1109","author":[{"given":"S.","family":"Wolf","sequence":"first","affiliation":[]},{"given":"J.","family":"Wullschleger","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405264"},{"key":"16","article-title":"Oblivious transfer is symmetric","author":"wolf","year":"2004","journal-title":"Cryptology ePrint Archive"},{"journal-title":"How to exchange secrets by oblivious transfer","year":"1981","author":"rabin","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.187904"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.3414"},{"journal-title":"Causality and Nonlocality As Axioms for Quantum Mechanics","year":"1997","author":"popescu","key":"12"},{"key":"3","doi-asserted-by":"crossref","first-page":"1874","DOI":"10.1103\/PhysRevLett.83.1874","article-title":"The cost of exactly simulating quantum entanglement with classical communication","volume":"83","author":"brassard","year":"1999","journal-title":"Phys Rev Lett"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_29"},{"key":"1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","article-title":"Precomputing oblivious transfer","volume":"963","author":"beaver","year":"1992","journal-title":"Advances in Cryptology - Crypto '95"},{"key":"10","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/62212.62215","article-title":"Founding cryptography on oblivious transfer","author":"kilian","year":"1988","journal-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC '88)"},{"key":"7","first-page":"306","article-title":"Efficient cryptographic protocols based on noisy channels","volume":"1233","author":"cre?peau","year":"1997","journal-title":"Advances in Cryptology - CRYPTO '97"},{"journal-title":"Quantum Entanglement Can Be Simulated Without Communication","year":"2004","author":"cerf","key":"6"},{"journal-title":"Implications of Superstrong Nonlocality for Cryptography","year":"2005","author":"buhrman","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0146-4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_9"},{"key":"8","article-title":"Efficient unconditional oblivious transfer from almost any noisy channel","author":"cre?peau","year":"2004","journal-title":"Proc SC '04"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523644.pdf?arnumber=1523644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T10:08:33Z","timestamp":1497694113000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523644\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523644","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}