2295 8 archive 2 disk0/00/00/22/95 2008-07-03 15:51:57 2008-07-03 15:51:57 2008-07-03 15:51:57 article show Hoque, Abu Sayed Md. Latiful asmlatifulhoque@cse.buet.ac.bd Hossain, Gahangir gahangir@gmail.com Bangladesh University of Engineering and Technology Chittagong University of Engineering and Technology, Bangladesh pub Q none PIR, P-cache, Database Caching, Hashing The increasing model of e-commerce infrastructure opens the door for secure transaction of information over the Net, keeping some records private as users’ choice within a few seconds. A client, while frequently retrieving his records, seldom wishes to hide the identity of the records to the database server. Private Information Retrieval (PIR) protocols allow users to retrieve information from a database while keeping their query private. Existing protocols have pros and cons in terms of communication and computational complexity. In some PIRs the computational complexity is reduced to O(1), and optimal, but still holds the high communication complexity O(Ns) as there is a huge amount of communication needed to satisfy the query. In our research a new PIR, namely PIR with P-cache, is introduced, based on the concept of database caching technology. In an average case, whenever a client requests a query in the system, there is a high probability to satisfy it from the P-cache instead of accessing the main database server that contains a huge amount of records. Our protocol outperforms the existing protocols in terms of both communication and computational complexity for queries supporting from P-cache and hence an improved performance. 2008 published Malaysian Journal of Computer Science 21 1 Faculty of Computer Science and Information Technology 33-44 TRUE 0127-9084 http://ejum.fsktm.um.edu.my/ArticleInformation.aspx?ArticleID=627 [1] B. Chor, O. Goldreich, E. Kushelevitz and M. Sudan, “Private Information Retrieval,” Journal of the ACM, Vol. 45, pp. 965-982, 1998. [2] E. Kushilevitz and R. Ostrovsky, “Replication is Not Needed: Single Database Private Information Retrieval,” In 38th Annual Symposium of Foundations of Computer Science, IEEE Computer Society, Miami Branch, Florida, pp. 364-373, October 20-22, 1997. [3] C. Cachin, S. Micali, and M. Stadler, “Computationally Private Information Retrieval with Polylogarithmic communication,” in Advances in Cryptology- EUROCRIPT’99, Vol. 1592, Prague, Czech Republic. Springer Verlag, pp. 402-414, May 1999. [4] D. Asonov, J. Christoph and J. C. Freytag, “Private Information Retrieval,” in the proceedings of the 1st Workshop on Privacy Enhancing Technologies San Francisco, USA, pp. 26-37, April 2001. [5] H. Lipmaa and S. Laur, “On Security of Sub-linear Oblivious Transfer,” in Technical Report 2004, International Association for Cryptologic Research, Vol. 63, pp. 10-35, February 25, 2004. [6] D. Asonov, J. Christoph and J. C. Freytag, “Almost Optimal Private Information Retrieval,” in the proceedings of the 2nd Workshop on Privacy Enhancing Technologies San Francisco, USA, pp. 56-72, April 2002. [7] R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala, “Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol,” in CSAIL, MIT, Vol. 1001, pp. 12-24, 2005. [8] H. Lipmaa, “An Oblivious Transfer Protocol With Log-Squared Communication,” in the 8th Information Security Conference, Singapore, Vol. 3650, pp. 314-328, September 20-23, 2005. [9] G. Semeraro, F. Abbattista, N. Fanizzi and S. Ferilli, “Intelligent Information Retrieval in a Digital Library Service,” in COGITO Project IST-1999-13347, pp. 123-146, March 2003. [10] D.Woodruff and S.Yekhanin, “A Geometric Approach to Information Theoretic Private Information Retrieval,” in Proc. of the 43rd IEEE Symposium on Foundation of Computer Science, Berlin, pp. 261-10, June 2004. [11] S.W. Smith and D.Safford, “Practical Private Information Retrieval with Secure Co-processor,” in Technical report, IBM research Division, T.J. Watson Research Center, pp. 26-39, July 2000. [12] A. Iliev and S. Smith, “Private Information Storage with Logarithmic Space Secure Hardware,” in Advances in Cryptology EUROCRIPT05, pp. 55-68, December 2005. [13] S. W. Smith and D.Safford, “Practical Server Privacy with Secure Co-processor,” in IBM Systems Journal, Vol. 40, no. 3, pp. 11-23, 2005. [14] T. Harder and A. Buhman, “Value Complete, Column Complete, Predicate Complete-Magic words Driving the design of Cache groups”, in The VLDB Journal, Vol. DOI 10.10007/S1007/s 00778-006, pp. 0035-0039, January 2007. [15] A. Buhmann and J. Klein, “Examining the Performance of a Constrain-Based Database Cache,” in ADBIS, Varna, F.J. Curry House of scientist, Bulgaria, 2007. [16] A.L. Young and M.M. Yung, “An Implementation of Tagged Private Information Retrieval,” in Chapter-8, Cryptovirology, Ver. 2.1, 2005-2006.