{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:36:10Z","timestamp":1729629370697,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/rivf.2006.1696415","type":"proceedings-article","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T17:01:13Z","timestamp":1158944473000},"page":"40-45","source":"Crossref","is-referenced-by-count":0,"title":["More extensions of weak oblivious transfer"],"prefix":"10.1109","author":[{"given":"M.","family":"Dang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.56.1154"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.3410"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.3414"},{"key":"13","first-page":"47","article-title":"Efficient unconditional oblivious transfer from almost any noisy channel","author":"crepeau","year":"2004","journal-title":"Forth Conference on Security in Communication Networks-SCN '04"},{"journal-title":"Variations on quantum oblivious transfer","year":"2005","author":"dang","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45116-1_22"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0146-4"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"journal-title":"How to exchange secrets by oblivious transfer","year":"1981","author":"rabin","key":"2"},{"key":"1","first-page":"20","article-title":"Founding cryptography on oblivious transfer","author":"kilian","year":"1988","journal-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing"},{"key":"10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BFb0054139","article-title":"On the foundations of oblivious transfer","author":"cachin","year":"1998","journal-title":"Advances in Cryptology Proc Of EUROCRYPT"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"4","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","article-title":"Equivalence between two flavours of oblivious transfers","volume":"293","author":"crepeau","year":"1988","journal-title":"Advances in Cryptography - Proceedings of Crypto"},{"key":"9","first-page":"306","article-title":"Efficient cryptographic protocols based on noisy channels","author":"cre?peau","year":"1997","journal-title":"Advances in Cryptology Proc Of EUROCRYPT"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21920"}],"event":{"name":"2006 International Conference onResearch, Innovation and Vision for the Future","location":"Ho Chi Minh City, Vietnam"},"container-title":["2006 International Conference onResearch, Innovation and Vision for the Future"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/11098\/35468\/01696415.pdf?arnumber=1696415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T09:16:00Z","timestamp":1587201360000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1696415\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/rivf.2006.1696415","relation":{},"subject":[]}}