{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:15:51Z","timestamp":1758269751435},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,5,6]],"date-time":"2010-05-06T00:00:00Z","timestamp":1273104000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10207-010-0105-2","type":"journal-article","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T06:20:48Z","timestamp":1273040448000},"page":"237-252","source":"Crossref","is-referenced-by-count":7,"title":["A new hardware-assisted PIR with O(n) shuffle cost"],"prefix":"10.1007","volume":"9","author":[{"given":"Xuhua","family":"Ding","sequence":"first","affiliation":[]},{"given":"Yanjiang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Robert H.","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Shuhong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,6]]},"reference":[{"key":"105_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"Abadi M., Feigenbaum J., Kilian J.: On hiding information from an oracle. J. Comput. Syst. Sci. 39, 21\u201350 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"105_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Upper bound on the communication complexity of private information retrieval. In: Proceedings of the 24th ICALP (1997)","DOI":"10.1007\/3-540-63165-8_196"},{"key":"105_CR3","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1147\/rd.483.0475","volume":"48","author":"T. Arnold","year":"2004","unstructured":"Arnold T., Doorn L.V.: The IBM PCIXCC: a new cryptographic coprocessor for the ibm eserver. IBM J. Res. Dev. 48, 541\u2013544 (2004)","journal-title":"IBM J. Res. Dev."},{"key":"105_CR4","unstructured":"Asonov, D.: Private information retrieval\u2014an overview and current trends. Tagungsband der GI\/OCG-Jahrestagung (2001)"},{"key":"105_CR5","doi-asserted-by":"crossref","unstructured":"Asonov, D.: Querying Databases Privately: A New Approach to Private Information Retrieval, LNCS, vol 3218. Springer (2004)","DOI":"10.1007\/b98671"},{"key":"105_CR6","unstructured":"Batcher, K.E.: Sorting networks and their applications"},{"key":"105_CR7","doi-asserted-by":"crossref","unstructured":"Beaver, D., Feigenbaum, J.: Hiding instances in multi-oracle queries. In: Proceedings of Symposium on Theoretical Aspects of Computer Science (1990)","DOI":"10.1007\/3-540-52282-4_30"},{"key":"105_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s001459900017","volume":"10","author":"D. Beaver","year":"1997","unstructured":"Beaver D., Feigenbaum J., Kilian J., Rogaway P.: Locally random reductions: improvements and appliations. J. Cryptol. 10, 17\u201336 (1997)","journal-title":"J. Cryptol."},{"key":"105_CR9","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y.: Information-theoretic private information retrieval: a unified construction. In: Proceedings of ICALP (2001)","DOI":"10.1007\/3-540-48224-5_74"},{"key":"105_CR10","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.F.: Breaking the o(n 1\/(2k-1)) barrier for information-theoretic private information retrieval. In: Proceedings of IEEE FOCS (2002)","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"105_CR11","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Proceedings of CRYPTO 2000","DOI":"10.1007\/3-540-44598-6_4"},{"key":"105_CR12","doi-asserted-by":"crossref","unstructured":"Beimel, A., Stahl, Y.: Robust information-theoretic private information retrieval. In: Proceedings of the 3rd Conference on Security in Communications Networks (2002)","DOI":"10.1007\/3-540-36413-7_24"},{"key":"105_CR13","unstructured":"Bennett, C., Brassard, G., Crepeau, C., Skubiszewska, M.H.: Practical quantum oblivious transfer protocols. In: Proceedings of Crypto \u201991"},{"key":"105_CR14","doi-asserted-by":"crossref","unstructured":"Black, J., Rogaway, P.: Ciphers with arbitrary finite domains. In: Proceedings of CT-RSA (2002)","DOI":"10.1007\/3-540-45760-7_9"},{"key":"105_CR15","doi-asserted-by":"crossref","unstructured":"Blakely, G., Meadows, C.: A database encryption scheme which allows computation of statistics using encrypted data. In: Proceedings of IEEE Symposium on Security and Privacy (1985)","DOI":"10.1109\/SP.1985.10024"},{"issue":"1","key":"105_CR16","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s102070100005","volume":"1","author":"C. Blundo","year":"2001","unstructured":"Blundo C., Darco P., DeSantis A.: A t-private k-database information retrieval scheme. Int. J. Inf. Secur. 1(1), 64\u201368 (2001)","journal-title":"Int. J. Inf. Secur."},{"key":"105_CR17","doi-asserted-by":"crossref","unstructured":"Boneh, D., Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Proceedings of EUROCRYPTO (2004)","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"105_CR18","doi-asserted-by":"crossref","unstructured":"Boneh, D., Kushilevitz, E., Ostrovsky, R., Skeith, W.: Public key encryption that allows PIR queries. In: Proceedings of CRYPTO (2007)","DOI":"10.1007\/978-3-540-74143-5_4"},{"key":"105_CR19","doi-asserted-by":"crossref","unstructured":"Brassard, G., Crpeau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In: Proceedings of CRYPTO \u201986","DOI":"10.1007\/3-540-47721-7_17"},{"issue":"6","key":"105_CR20","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G. Brassard","year":"1996","unstructured":"Brassard G., Crpeau C., Santha M.: Oblivious transfers and intersecting codes. IEEE Trans. Inf. Theory 42(6), 1769\u20131780 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"105_CR21","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylog communication. In: Proceedings of EUROCRYPTO 99"},{"issue":"2","key":"105_CR22","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum D.: Untraceable electronic mail, return addresses and digital pseudonyms. Commun. ACM 24(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"105_CR23","doi-asserted-by":"crossref","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval. In: Proceedings of the 29th STOC (1997)","DOI":"10.1145\/258533.258609"},{"key":"105_CR24","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. Tech. rep., Israel Institute of Technology (1997)"},{"key":"105_CR25","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. In: Proceedings of IEEE FOCS (1995)"},{"issue":"6","key":"105_CR26","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B. Chor","year":"1998","unstructured":"Chor B., Kushilevitz E., Goldreich O., Sudan M.: Private information retrieval. J. ACM 45(6), 965\u2013982 (1998)","journal-title":"J. ACM"},{"key":"105_CR27","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2003","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms. 2nd edn. The MIT Press, Cambridge (2003)","edition":"2"},{"key":"105_CR28","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: Improved definitions and efficient constructions. In: Proceedings of ACM CCS (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"105_CR29","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: Proceedings of ACISP (2003)","DOI":"10.1007\/3-540-45067-X_30"},{"issue":"1","key":"105_CR30","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s001450010008","volume":"14","author":"G. DiCrescenzo","year":"2001","unstructured":"DiCrescenzo G., Ishai Y., Ostrovsky R.: Universal service provides for private information retrieval. J. Cryptol. 14(1), 37\u201374 (2001)","journal-title":"J. Cryptol."},{"key":"105_CR31","unstructured":"Feigenbaum, J.: Encrypting problem instances: Or..., can you take advantage of someone without having to trust him. In: Proceedings of CRYPTO (1985)"},{"key":"105_CR32","unstructured":"Gasarch, W.: A survey on private information retrieval. The Bulletin of the European Association for Theoretical Computer Science, Computational Complexity Column (82) (2004)"},{"key":"105_CR33","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Goldwasser, S., Malkin, T.: A random server mode for private information retrieval or information theoretic PIR avoiding database replication. In: Proceedings of the 2nd RANDOM (1998)","DOI":"10.1007\/3-540-49543-6_17"},{"key":"105_CR34","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: Proceedings of ACM STOC (1998)","DOI":"10.1145\/276698.276723"},{"issue":"3","key":"105_CR35","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich O., Ostrovsky R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"issue":"5","key":"105_CR36","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/PGEC.1967.264771","volume":"16","author":"J. Goldstein","year":"1967","unstructured":"Goldstein J., Leibholz S.: On the synthesis of signal switching networks with transient blocking. IEEE Trans. Electron. Comput. 16(5), 637\u2013641 (1967)","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"2","key":"105_CR37","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser S., Micali S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"105_CR38","doi-asserted-by":"crossref","unstructured":"Hastand, J.: Pseudo-random generators with uniform assumptions. In: Proceedings of the 22nd ACM STOC (1990)","DOI":"10.1145\/100216.100270"},{"key":"105_CR39","unstructured":"Iliev, A., Smith, S.: Private information storage with logarithm-space secure hardware. In: Proceedings of International Information Security Workshops (2004)"},{"issue":"2","key":"105_CR40","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MSP.2005.49","volume":"3","author":"A. Iliev","year":"2005","unstructured":"Iliev A., Smith S.: Protecting client privacy with trusted computing at the server. IEEE Secur. Priv. 3(2), 20\u201328 (2005)","journal-title":"IEEE Secur. Priv."},{"key":"105_CR41","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Improved upper bounds on information-theoretic private information retrieval. In: Proceedings of the 31th ACM STOC (1999)","DOI":"10.1145\/301250.301275"},{"key":"105_CR42","unstructured":"Itoh, T.: Efficient private information retrieval. IEICE Transactions on Fundamentals, ES2-A(1) (1999)"},{"key":"105_CR43","doi-asserted-by":"crossref","unstructured":"Kerenidis, I., de Wolf, R.: Exponential lower bound for 2-query locally decodeable codes via a quantum argument. In: Proceedings of the 35th ACM STOC (2003)","DOI":"10.1145\/780542.780560"},{"key":"105_CR44","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Yung, M.: Secure games with polynomial expressions. In: Proceedings of the 28th ICALP (2001)","DOI":"10.1007\/3-540-48224-5_76"},{"key":"105_CR45","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In: Proceedings of EUROCRYPTO (2000)","DOI":"10.1007\/3-540-45539-6_9"},{"key":"105_CR46","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally private information retrieval. In: Proceeding of the 38th IEEE FOCS (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"105_CR47","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Proceedings of ISC (2005)","DOI":"10.1007\/11556992_23"},{"key":"105_CR48","volume-title":"Data structures and algorithms, vol 1. Sorting and Searching","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn K.: Data structures and algorithms, vol 1. Sorting and Searching. Springer, New York (1984)"},{"key":"105_CR49","unstructured":"Mishra, S., Sarkar, P.: Symmetrically private information retrieval. In: Proceedings of 1st INDOCRYPT (2000)"},{"key":"105_CR50","doi-asserted-by":"crossref","unstructured":"Morric, B., Rogaway, P., Stegers, T.: How to encipher messages on a small domain: Deterministic encryption and the thorp shuffle. In: Proceedings of CRYPTO (2009)","DOI":"10.1007\/978-3-642-03356-8_17"},{"key":"105_CR51","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proceedings of the 31st ACM STOC (1999)","DOI":"10.1145\/301250.301312"},{"key":"105_CR52","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage. In: Proceedings of the 29th STOC (1997)"},{"key":"105_CR53","doi-asserted-by":"crossref","unstructured":"Pryamikov, V.: Enciphering with arbitrary finite domains. In: Proceedings of INDOCRYPT (2006)","DOI":"10.1007\/11941378_18"},{"issue":"4","key":"105_CR54","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/49.668972","volume":"16","author":"M. Reed","year":"1998","unstructured":"Reed M., Syverson P., Goldschag D.: Anonymous connections and onion routing. IEEE J. Sel. Areas Commun. 16(4), 482\u2013494 (1998)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"105_CR55","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M. Reiter","year":"1998","unstructured":"Reiter M., Rubin A.: Crowds: anonymity for web transactions. ACM Trans. Inf. Syst. Secur. 1(1), 66\u201392 (1998)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"105_CR56","unstructured":"Shoup, V.: Sequence of games: a tool for taming complexity in security proofs. Cryptology ePrint report 2004\/332, November 30 (2004)"},{"key":"105_CR57","unstructured":"Sion, R., Carbunar, B.: On the computational practicality of private information retrieval. In: Proceedings of NDSS (2007)"},{"key":"105_CR58","doi-asserted-by":"crossref","unstructured":"Smith, S., Safford, D.: Practical server privacy with secure coprocessors. IBM Systems Journal 40(3), 683\u2013695 (2001)","DOI":"10.1147\/sj.403.0683"},{"issue":"1","key":"105_CR59","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A. Waksman","year":"1968","unstructured":"Waksman A.: A permutation network. J. ACM 15(1), 159\u2013163 (1968)","journal-title":"J. ACM"},{"key":"105_CR60","doi-asserted-by":"crossref","unstructured":"Wang, S., Ding, X., Deng, R., Bao, F.: Private information retrieval using trusted hardware. In: Proceedings of the 11th ESORICS (2006)","DOI":"10.1007\/11863908_4"},{"key":"105_CR61","unstructured":"Williams, P., Sion, R.: Usable PIR. In: Proceedings of NDSS (2008)"},{"key":"105_CR62","doi-asserted-by":"crossref","unstructured":"Williams, P., Sion, R., Carbunar, B.: Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In: Proceedings of ACM CCS (2008)","DOI":"10.1145\/1455770.1455790"},{"issue":"4","key":"105_CR63","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1137\/06065773X","volume":"47","author":"D. Woodruff","year":"2007","unstructured":"Woodruff D., Yekhanin S.: A geometric approach to information-theoretic private information retrieval. SIAM 47(4), 1046\u20131056 (2007)","journal-title":"SIAM J. Comput."},{"key":"105_CR64","doi-asserted-by":"crossref","unstructured":"Yamamura, A., Saito, T.: Private information retrieval based on subgroup membership problem. In: Proceedings of the 6th ACISP (2001)","DOI":"10.1007\/3-540-47719-5_18"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0105-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-010-0105-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0105-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:01:24Z","timestamp":1559127684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-010-0105-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,6]]},"references-count":64,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["105"],"URL":"https:\/\/doi.org\/10.1007\/s10207-010-0105-2","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,6]]}}}