A RESEARCH SURVEY: RFID SECURITY & PRIVACY ISSUE <s> Strawman1 'Query Encryption' <s> Data confidentiality is a major concern in database systems. Encryption is a useful tool for protecting the confidentiality of sensitive data. However, when data is encrypted, performing queries becomes more challenging. In this paper, we study efficient and provably secure methods for queries on encrypted data stored in an outsourced database that may be susceptible to compromise. Specifically, we show that, in our system, even if an intruder breaks into the database and observes some interactions between the database and its users, he only learns very little about the data stored in the database and the queries performed on the data. Our work consists of several components. First, we consider databases in which each attribute has a finite domain and give a basic solution for certain kinds of queries on such databases. Then, we present two enhanced solutions, one with a stronger security guarantee and the other with accelerated queries. In addition to providing proofs of our security guarantees, we provide empirical performance evaluations. Our experiments demonstrate that our solutions are fast on large-sized real data. <s> BIB001 </s> A RESEARCH SURVEY: RFID SECURITY & PRIVACY ISSUE <s> Strawman1 'Query Encryption' <s> Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impractical to deploy due to the prohibitively high communication and computation complexity. The recent trend in outsourcing databases fuels the research on practical PIR schemes. In this paper, we propose a new PIR system by making use of trusted hardware. Our system is proven to be information theoretically secure. Furthermore, we derive the computation complexity lower bound for hardware-based PIR schemes and show that our construction meets the lower bounds for both the communication and computation costs, respectively. <s> BIB002 </s> A RESEARCH SURVEY: RFID SECURITY & PRIVACY ISSUE <s> Strawman1 'Query Encryption' <s> This study explores how privacy preferences vary with place and social context. These findings are useful for designing privacy policies and user interfaces for pervasive computing. <s> BIB003 </s> A RESEARCH SURVEY: RFID SECURITY & PRIVACY ISSUE <s> Strawman1 'Query Encryption' <s> RFID technology is increasingly being deployed in ubiquitous computing environments for object tracking and localization. Existing tracking architecture usually assumes the use of a trusted server which is invulnerable to compromise by internal and external adversaries. However, maintaining such a trusted server is unlikely in the real world. In this paper, we consider the problem of adding privacy protection to object tracking systems built upon passive RFID tags, without relying on a trusted server assumption. Our protocol continues to protect user privacy in the event of partial compromise of a server. <s> BIB004
According to Strawman1, encryption of the data protects user's privacy but may cause slow query performance and according to Strawman2 the protocol must ensure that user's query does not reveal useful information that an adversary can use to violate user's privacy. Strawman Solution is used for encryption of query to improve privacy but Solution-1 is only suitable for small size table and Solution-2 prevents likability so long as the adversary never observes a user querying a database BIB004 . Privacy protection is an important part in ubiquitous computing environments BIB003 . For example in June 2005, names and credit card numbers of more than 40 million MasterCard cardholders were exposed and In May 2006, disks containing the names, social security numbers and dates of birth of more than 26 million United States veterans were stolen from the home of an employee of the department of Veterans Affairs BIB001 . Retrieval of sensitive data from databases invokes concerns on user privacy. Thus a PIR (Private Information Retrieval) scheme allows a user to retrieve a data from a database without revealing other information. Earlier "Query Privacy" was also proposed BIB002 . In a current scenario various fundamental approaches like anonymity and clocking-based approach can't give surety of information privacy as well as cheap computation and communication overhead.