{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T10:45:20Z","timestamp":1767523520379,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-30909","CCF-30149"],"award-info":[{"award-number":["CCF-30909","CCF-30149"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Department of Defense Multidisciplinary University Research Initiative","award":["96045"],"award-info":[{"award-number":["96045"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/jstsp.2015.2432740","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T18:52:58Z","timestamp":1431456778000},"page":"1229-1239","source":"Crossref","is-referenced-by-count":28,"title":["Efficient Private Information Retrieval Over Unsynchronized Databases"],"prefix":"10.1109","volume":"9","author":[{"given":"Giulia","family":"Fanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref30","first-page":"187","article-title":"How to exchange secrets with oblivious transfer","volume":"2005","author":"rabin","year":"2005","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CMPSAC.2002.1045104"},{"key":"ref34","first-page":"2006","article-title":"On the computational practicality of private information retrieval","author":"sion","year":"2007","journal-title":"Proc NDSS"},{"key":"ref10","first-page":"83","article-title":"Optimally robust private information retrieval","volume":"2012","author":"devet","year":"2012","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.21236\/ADA465464","author":"dingledine","year":"2004","journal-title":"?Tor The second-generation onion router ?"},{"key":"ref12","article-title":"Efficient private information retrieval over unsynchronized databases","author":"fanti","year":"2014","journal-title":"Proc Allerton"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49543-6_17"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.23"},{"journal-title":"?Yahoo Hacked 450 000 Passwords Posted Online ?","year":"0","author":"gross","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1147\/rd.203.0204"},{"key":"ref17","first-page":"417","article-title":"Trackmenot: Resisting surveillance in web search","volume":"23","author":"howe","year":"2009","journal-title":"Lessons from the Identity Trail Anonymity Privacy and Identity in a Networked Society"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"ref4","first-page":"1","article-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation","author":"ben-or","year":"1988","journal-title":"Proc STOC"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14527-8_2"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-36413-7_24","article-title":"Robust information-theoretic private information retrieval","author":"beimel","year":"2003","journal-title":"Proc Security Commun Netw"},{"key":"ref6","first-page":"106","article-title":"Universal classes of hash functions","author":"carter","year":"1977","journal-title":"Proc STOC"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.808103"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.27"},{"journal-title":"Probability Induction and Statistics","year":"1972","author":"de finetti","key":"ref8"},{"key":"ref7","first-page":"41","article-title":"Private information retrieval","author":"chor","year":"1995","journal-title":"Proc IEEE FOCS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.03.002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08506-7_4"},{"journal-title":"A Face is Exposed for AOL Searcher no 4417749","year":"2006","author":"barbaro","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1177\/2053951714541861"},{"key":"ref22","first-page":"483","article-title":"Biff codes: Fast error correction for large data sets","author":"mitzenmacher","year":"2012","journal-title":"Proc ISIT"},{"journal-title":"?Verizon draws fire for monitoring app usage browsing habits ?","year":"2012","author":"mccullagh","key":"ref21"},{"journal-title":"Practical Private Information Retrieval","year":"2011","author":"olumofin","key":"ref24"},{"key":"ref23","first-page":"448","article-title":"Efficient oblivious transfer protocols","author":"naor","year":"2001","journal-title":"Proc SODA"},{"journal-title":"Pulse Peeling-based Ultra-low Complexity Algorithms for Sparse Signal Estimation","year":"0","author":"pawar","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-0565-3"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/4200690\/7265114\/7105864-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/7265114\/07105864.pdf?arnumber=7105864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:52:09Z","timestamp":1649443929000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7105864\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":35,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2015.2432740","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"type":"print","value":"1932-4553"},{"type":"electronic","value":"1941-0484"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}