{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:44:21Z","timestamp":1772725461422,"version":"3.50.1"},"reference-count":17,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2009,8,7]],"date-time":"2009-08-07T00:00:00Z","timestamp":1249603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,8,7]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>This paper aims to address the privacy problem associated with the use of internet search engines. The purpose of the paper is to propose and validate a set of methods and protocols to guarantee the privacy of users' queries.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>In this paper<jats:italic>h<\/jats:italic>(<jats:italic>k<\/jats:italic>)\u2010private information retrieval (<jats:italic>h<\/jats:italic>(<jats:italic>k<\/jats:italic>)\u2010PIR) is defined as a practical compromise between computational efficiency and privacy. Also presented are<jats:italic>h<\/jats:italic>(<jats:italic>k<\/jats:italic>)\u2010PIR protocols that can be used to query any database, which does not even need to know that the user is trying to preserve his or her privacy.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>The proposed methods are able to properly protect the privacy of users' queries. When internet users apply the protocols, search engines (e.g. Google) are not able to determine unequivocally the real interests of their users. The quality of the results does decrease with the increase in privacy, but the obtained trade\u2010off is excellent.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>Current private information retrieval (PIR) protocols suffer from two significant shortcomings: their computational complexity is<jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic>) where<jats:italic>n<\/jats:italic>is the number of records in the database, which precludes their use for very large databases and web search engines; and they assume that the database server cooperates in the PIR protocol, which prevents deployment in real\u2010life uncooperative settings. The proposed protocols overcome both problems.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>This is the first set of protocols that offer practical protection for the privacy of the queries that internet users submit to an internet search engine. The proposal has been implemented and it will be released to the general public soon. It will help to protect the right to privacy of millions of internet users.<\/jats:p><\/jats:sec>","DOI":"10.1108\/14684520910985693","type":"journal-article","created":{"date-parts":[[2009,10,5]],"date-time":"2009-10-05T10:28:08Z","timestamp":1254738488000},"page":"720-744","source":"Crossref","is-referenced-by-count":80,"title":["<i>h<\/i>(<i>k<\/i>)\u2010private information retrieval from privacy\u2010uncooperative queryable databases"],"prefix":"10.1108","volume":"33","author":[{"given":"Josep","family":"Domingo\u2010Ferrer","sequence":"first","affiliation":[]},{"given":"Agusti","family":"Solanas","sequence":"additional","affiliation":[]},{"given":"Jordi","family":"Castell\u00e0\u2010Roca","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022012120294933500_b1","unstructured":"AOL (2006), \u201cAOL keyword searches\u201d (online), available at: http:\/\/dontdelete.com\/default.asp (accessed 2 December 2008)."},{"key":"key2022012120294933500_b2","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y. and Malkin, T. (2004), \u201cReducing the servers computation in private information retrieval: PIR with preprocessing\u201d, Journal of Cryptology, Vol. 17, pp. 125\u201051.","DOI":"10.1007\/s00145-004-0134-y"},{"key":"key2022012120294933500_b3","unstructured":"Chor, B., Gilboa, N. and Naor, M. (1997), Technical Report TR CS0917, Private information retrieval by keywords, Department of Computer Science, Technion, Israel Institute of Technology, Haifa."},{"key":"key2022012120294933500_b4","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E. and Sudan, M. (1995), \u201cPrivate information retrieval\u201d, in Proccedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), 23\u201025 October, IEEE, pp. 41\u201050."},{"key":"key2022012120294933500_b5","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E. and Sudan, M. (1998), \u201cPrivate information retrieval\u201d, Journal of the ACM, Vol. 45, pp. 965\u201081.","DOI":"10.1145\/293347.293350"},{"key":"key2022012120294933500_b6","doi-asserted-by":"crossref","unstructured":"Domingo\u2010Ferrer, J. (2007), \u201cA three\u2010dimensional conceptual framework for database privacy, in Secure Data Management \u2013 4th VLDB Workshop (SDM 2007)\u201d, Lecture Notes in Computer Science, Vol. 4721, Springer, Berlin and Heidelberg, pp. 193\u2010202.","DOI":"10.1007\/978-3-540-75248-6_14"},{"key":"key2022012120294933500_b7","doi-asserted-by":"crossref","unstructured":"Domingo\u2010Ferrer, J. and Solanas, A. (2008), \u201cA measure of variance for nominal hierarchical attributes\u201d, Information Sciences, Vol. 178, pp. 4644\u201055.","DOI":"10.1016\/j.ins.2008.08.003"},{"key":"key2022012120294933500_b8","doi-asserted-by":"crossref","unstructured":"Domingo\u2010Ferrer, J., Seb\u00e9, F. and Solanas, A. (2008), \u201cA polynomial\u2010time approximation to optimal multivariate microaggregation\u201d, Computers and Mathematics with Applications, Vol. 55, pp. 714\u201032.","DOI":"10.1016\/j.camwa.2007.04.034"},{"key":"key2022012120294933500_b9","doi-asserted-by":"crossref","unstructured":"Goldwasser, S. and Micali, S. (1984), \u201cProbabilistic encryption\u201d, Journal of Computer and Systems Science, Vol. 28 No. 1, pp. 270\u201099.","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"key2022012120294933500_b10","doi-asserted-by":"crossref","unstructured":"Howe, D.C. and Nissenbaum, H. (2009), \u201cTrackMeNot: resisting surveillance in web search\u201d, in Kerr, I., Steeves, V. and Lucock, C. (Eds), Lessons from the Identity Trail: Privacy, Anonymity and Identity in a Networked Society, Oxford University Press, Oxford.","DOI":"10.1093\/oso\/9780195372472.003.0023"},{"key":"key2022012120294933500_b11","unstructured":"Kushilevitz, E. and Ostrovsky, R. (1997), \u201cReplication is not needed: single database, computationally\u2010private information retrieval\u201d, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 20\u201022 October, IEEE, pp. 364\u2010373."},{"key":"key2022012120294933500_b12","unstructured":"Lane, J., Heus, P. and Mulcahy, T. (2008), \u201cData access in a cyber world: making use of cyberinfrastructure\u201d, Transactions on Data Privacy, Vol. 1 No. 1, pp. 2\u201016."},{"key":"key2022012120294933500_b13","unstructured":"Leech, G., Rayson, P. and Wilson, A. (2001), Word Frequencies in Written and Spoken English: Based on the British National Corpus, Longman, London."},{"key":"key2022012120294933500_b14","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R. and Skeith, W.E. III (2007), \u201cA survey of single\u2010database PIR: techniques and applications, in public key cryptography \u2013 PKC 2007\u201d, Lecture Notes in Computer Science, Vol. 4450, Springer, Berlin and Heidelberg, pp. 393\u2010411.","DOI":"10.1007\/978-3-540-71677-8_26"},{"key":"key2022012120294933500_b15","unstructured":"Samarati, P. and Sweeney, L. (1998), Protecting privacy when disclosing information: k\u2010anonymity and its enforcement through generalization and suppression, Technical report, SRI International, Menlo Park, CA."},{"key":"key2022012120294933500_b16","unstructured":"Shannon, C.E. (1948), \u201cA mathematical theory of communication\u201d, Bell Systems Technical Journal, Vol. 14 No. 1, pp. 7\u201013."},{"key":"key2022012120294933500_b17","unstructured":"Staddon, J., Golle, P. and Zimny, B. (2007), \u201cWeb\u2010based inference detection\u201d, in Proceedings of the 16th USENIX Security Symposium, The Advanced Computer Systems Association, pp. 71\u201086."}],"container-title":["Online Information Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/14684520910985693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/14684520910985693\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/14684520910985693\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:41:18Z","timestamp":1753404078000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/oir\/article\/33\/4\/720-744\/314695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,7]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8,7]]}},"alternative-id":["10.1108\/14684520910985693"],"URL":"https:\/\/doi.org\/10.1108\/14684520910985693","relation":{},"ISSN":["1468-4527"],"issn-type":[{"value":"1468-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8,7]]}}}