Journal Title : International Journal of Modern Trends in Engineering and Science

Author’s Name : P.Sangeeth Kumar, M.Jawahar

Volume 01 Issue o5  Year 2014  

ISSN no:  2348-3121  

Page no: 123-127

Abstract—Cloud computing can be storing and securing immense amounts of data that is accessible only by authorized applications and users. In Computational Private Information Retrieval (cPIR) protocols allow a client to retrieve bit of data from a database, the server does not inferring any information about the queried bit in cPIR. In practically users invoke complex arithmetic operations for every bit of the database. In this paper present pCloud, a distributed system that constitutes the first attempt towards practical cPIR. The approach assumes a disk-based architecture that retrieves one page with a single query, using a striping technique and distributes the database to a number of cooperative peers, and leverages these computational resources to process cPIR queries in parallel. The results indicate that pCloud reduces considerably the query response time compared to the traditional client/server model, and has a very low communication overhead. Additionally, pCloud scales well with an increasing number of peers, achieving a linear speed-up. Finally Advanced Encryption Standard (AES) algorithm ensures that the hash code is encrypted in a highly secure manner. The AES is symmetric-key encryption standards to perform a various of operations in this paper, that can be send a packet to multiple sites at the same time and retrieve arbitrarily large blocks of information.

KeywordsAccess control, Advanced Encryption Standard, Authentication, Cloud security.


[1]. Ambainis,A.(1997) ‘Upper bound on communication complexity of private information retrieval’. In ICALP.
[2]. Beimel,A. and Ishai,Y.(2002) ‘Breaking the barrier for information-theoretic private information retrieval’. In FOCS.
[3]. Cachin,C and Stadler,M.(1999) ‘Computationally private information retrieval with polylogarithmic communication’. In EUROCRYPT
[4]. Chor,B. and Kushilevitz,E.(1995) ‘Private information retrieval’. In FOCS.
[5]. Gasarch,W.and Yerukhimovich,A.(2006) ‘Computationally inexpensive cPIR’.
[6]. Gentry,C. and Ramzan,Z.(2005) ‘Single-database private information retrieval with constant communication rate’. In ICALP.
[7]. Ghinita,G. and Kalnis,P.(2008) ‘Private queries in location based services: Anonymizers are not necessary’. In SIGMOD.
[8]. Iliev,A.(2004) ‘Private information storage with logarithm-space secure hardware’. In Proc. International Information Security Workshops.
[9]. Khoshgozaran,A. and Shahabi,C.(2008) ‘SPIRAL: A scalable private information retrieval approach to location Privacy’. In PALMS.
[10]. Kushilevitz,E. and Ostrovsky,R.(1997). ‘Replication is not needed: Single database, computationally-private information retrieval’. In FOCS, (1997).
[11]. Lipmaa,H.(2005) ‘An oblivious transfer protocol with log-squared Communication’. In ISC.
[12]. Gaborit,P.(2008) ‘A fast private information retrieval Protocol’. In ISIT.
[13]. Ostrovsky,R.(2007) ‘A survey of single-database private information retrieval: Techniques and applications’. In PKC.
[14]. R. Sion and B. Carbunar.(2007) ‘On the computational practicality of private information retrieval’. In NDSS.
[15]. Stoica,I. and Morris,R.(2001) ‘Chord: A scalable peer-to-peer lookup service for internet Applications’. In SIGCOMM.

Full Pdf Paper-Click Here


Scroll Up