Examining the Performance of a Constraint-Based Database Cache

Buhmann,; Klein, S. R.

doi:10.1109/ideas.2007.4318117

Cited by 1 publication

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The burning problem is to understand whether PIR protocols involving constant number of servers require polynomial (or poly logarithmic) amount of communication. Harder et al [14] provides the guidelines of designing database caching and Buhmann and Klein [15] examined the performance of a database cache. Young and Yung [16] explained the implementation techniques of a PIR protocol in their writing "Cryptovirology".…”

Section: Literature Reviewmentioning

confidence: 99%

PIR with P-Cache: A New Private Information Retrieval Protocol With Improved Performance

Hoque

Hossain

2008

MJCS

View full text Add to dashboard Cite

The increasing model of e-commerce infrastructure opens the door for secure transaction of information over the 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.Keywords: PIR, P-cache, Database Caching, Hashing. INTRODUCTIONAs online transaction is increases day by day, the use of secured online software with database access and information retrieval is also ever-increasing. Private Information Retrieval (PIR), a protocol that allows the user to retrieve information from a database server while hiding the identity of the record retrieved by the user, meets the requirements of the next generation e-commerce applications. Some applications of the PIR are patent databases, pharmaceutical databases, media databases, digital library, e-voting system, ethical hacking, bioinformatics, secret sharing etc.It is a big challenge to create database with efficient PIR protocols that can ensure a good or at least acceptable response time. The main costs of PIR protocols are the communication and computational cost during query processing. A number of research works have been performed in recent years to reduce both the costs. Chor et al.[1] states two fundamental assumptions for PIR. Firstly, PIR is impossible unless we consider sending the entire database to the client as a solution; that is communication complexity is proven to the total size of the database. Secondly, in order to answer a query, the entire database must be read. In this case, the computational complexity is equal to the searching time on the whole database. On the other hand, it is a violation of user privacy if some records in the server are not read by client while processing.To solve the existing problems and to improve the performance of a PIR, the database caching technology is used in our proposed PIR with P-cache. Existing technology requires preprocessing and off-line communication to improve performance. The use of P-cache technology requires a little preprocessing and offline communication and achieves reasonable performance in most cases.

show abstract

Section: Literature Reviewmentioning

confidence: 99%