{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:26:21Z","timestamp":1673342781919},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1109\/tifs.2010.2101062","type":"journal-article","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T17:32:31Z","timestamp":1293039151000},"page":"189-201","source":"Crossref","is-referenced-by-count":8,"title":["Database Access Pattern Protection Without Full-Shuffles"],"prefix":"10.1109","volume":"6","author":[{"given":"Xuhua","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanjiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert H.","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2005.49"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646125"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_9"},{"key":"ref13","first-page":"324","article-title":"an oblivious transfer protocol with log-squared communication","author":"lipmaa","year":"0","journal-title":"Proc ISCAS 2005"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258606"},{"key":"ref15","first-page":"502","article-title":"oblivious ram revisited","author":"pinkas","year":"0","journal-title":"Proc CRYPTO 2010"},{"key":"ref16","author":"shoup","year":"2004","journal-title":"Sequence of Games A Tool for Taming Complexity in Security Proofs"},{"key":"ref17","article-title":"on the computational practicality of private information retrieval","author":"sion","year":"2007","journal-title":"Proc NDSS'07"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1147\/sj.403.0683"},{"key":"ref19","first-page":"49","article-title":"private information retrieval using trusted hardware","author":"wang","year":"2006","journal-title":"Proc ESORICS '06"},{"key":"ref4","first-page":"114","article-title":"ciphers with arbitrary finite domains","author":"black","year":"0","journal-title":"Proc CT-RSA 2002"},{"key":"ref3","first-page":"55","article-title":"reducing the servers computation in private information retrieval: pir with preprocessing","author":"beimel","year":"2000","journal-title":"Proc CRYPTO'00"},{"key":"ref6","first-page":"41","article-title":"private information retrieval","author":"chor","year":"1995","journal-title":"Proc FOCS 95"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258609"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-45067-X_30","article-title":"A length-flexible threshold cryptosystem with applications","author":"damgrd","year":"2003","journal-title":"Proc Australasian Conf Information Security and Privacy"},{"key":"ref2","first-page":"261","article-title":"breaking the <ref_formula><tex notation=\"tex\">$o(n^{1\/(2k-1)})$<\/tex> <\/ref_formula> barrier for information-theoretic private information retrieval","author":"beimel","year":"2002","journal-title":"Proc IEEE FOCS'02"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.483.0475"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8145-6_17"},{"key":"ref20","article-title":"usable pir","author":"williams","year":"0","journal-title":"Proc NDSS 2008"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85886-7_5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455790"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10206\/5712892\/05672595.pdf?arnumber=5672595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:46:53Z","timestamp":1633909613000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5672595\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":22,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2010.2101062","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}