{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:19:13Z","timestamp":1729646353500,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/wimob.2005.1512846","type":"proceedings-article","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T14:35:47Z","timestamp":1159972547000},"page":"25-31","source":"Crossref","is-referenced-by-count":1,"title":["Optimal secure data retrieval using an oblivious transfer scheme"],"prefix":"10.1109","volume":"2","author":[{"given":"B.","family":"Malek","sequence":"first","affiliation":[]},{"given":"A.","family":"Miri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"119","article-title":"A generalisation, simplification and some applications of paillier's probabilistic public-key system","volume":"1992","author":"damgard","year":"2001","journal-title":"Public Key Crytography 2001"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"18","first-page":"206","article-title":"Paillier's cryptosystem revisited","author":"catalano","year":"2001","journal-title":"The Proceedings of the ACM Conference on Computer and Communication Security 2001"},{"key":"15","first-page":"283","article-title":"Algorithms for black-box fields and their application to cryptography","volume":"1109","author":"boneh","year":"1996","journal-title":"Advances in Cryptology Crypto86"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"13","first-page":"162","article-title":"How to generate and exchange secrets (extended abstract)","author":"yao","year":"1986","journal-title":"26th Annual Symposium on Foundations of Computer Science"},{"key":"14","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1007\/3-540-45022-X_43","article-title":"One-round secure computation and secure autonomous mobile agents","volume":"1853","author":"cachin","year":"2000","journal-title":"Proc 29th Int Colloquium Automata Languages Program (ICALP)"},{"key":"11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/3-540-49649-1_28","article-title":"A new and efficient all-or-nothing disclosure of secrets protocol","volume":"1514","author":"stern","year":"1998","journal-title":"Advances in Cryptology ASIACRYPT'98"},{"key":"12","article-title":"An oblivious transfer protocol with log-squared communication","volume":"2004","author":"lipmaa","year":"2004","journal-title":"Cryptology ePrint Archive Report"},{"key":"21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-44598-6_6","article-title":"Optimistic fair secure computation","volume":"1880","author":"cachin","year":"2000","journal-title":"Advances in Cryptology ? CRYPTO 2000"},{"key":"3","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","article-title":"Computationally private information retrieval with polylogarithmitic communication","volume":"1592","author":"cachin","year":"1999","journal-title":"Advances in Cryptology Proc Eurocrypt 99"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_21"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0134-y"},{"key":"1","first-page":"1","article-title":"Private information retrieval with homomorphic encryption functions","volume":"7","author":"malek","year":"2004","journal-title":"Proc"},{"key":"10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-36467-6_16","article-title":"Almost optimal private information retrieval","volume":"2482","author":"asonov","year":"2003","journal-title":"Proc Workshop on Privacy Enhancing Technologies"},{"key":"7","first-page":"123","article-title":"Time limited blackbox security: Protecting mobile agents from malicious hosts","volume":"1419","author":"hohl","year":"1998","journal-title":"Mobile Agent Security"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/643477.643479"},{"key":"5","first-page":"448","article-title":"Efficient oblivious transfer protocols","author":"naor","year":"2001","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","article-title":"Privacy preserving data-mining","volume":"1880","author":"lindell","year":"2000","journal-title":"Advances in Cryptology- Crypto'2000"},{"key":"9","first-page":"162","article-title":"An efficient and practical scheme for privacy protection in the e-commerce of digital goods","volume":"2015","author":"bao","year":"2001","journal-title":"Proc Int Conf Cryptology and Information Security"},{"key":"8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-49380-8_9","article-title":"On software protection via function hiding","volume":"1525","author":"sander","year":"1998","journal-title":"Proc 1st Int Workshop on Information Hiding"}],"event":{"name":"WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005.","location":"Montreal, Canada"},"container-title":["WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10102\/32399\/01512846.pdf?arnumber=1512846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T12:52:10Z","timestamp":1555851130000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1512846\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/wimob.2005.1512846","relation":{},"subject":[]}}