Anonymity, unobservability, and pseudeonymity — a proposal for terminology
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Oblivious transfer with access control
Proceedings of the 16th ACM conference on Computer and communications security
First CPIR protocol with data-dependent computation
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Single-database private information retrieval with constant communication rate
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
FAUST: efficient, TTP-free abuse prevention by anonymous whitelisting
Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Efficient and secure ranked multi-keyword search on encrypted cloud data
Proceedings of the 2012 Joint EDBT/ICDT Workshops
PRISM: privacy-preserving search in mapreduce
PETS'12 Proceedings of the 12th international conference on Privacy Enhancing Technologies
An efficient privacy-preserving multi-keyword search over encrypted cloud data with ranking
Distributed and Parallel Databases
Hi-index | 0.00 |
A Private Information Retrieval (PIR) protocol allows a user to obtain information from a database in a manner that prevents the database from knowing which data was retrieved. Although substantial progress has been made in the discovery of computationally PIR (cPIR) protocols with reduced communication complexity, there has been relatively little work in reducing the computational complexity of cPIR protocols. In particular, Sion and Carbunar argue that existing cPIR protocols are slower than the trivial PIR protocol (in overall performance). In this paper, we present a new family of cPIR protocols with a variety of security and performance properties. Our protocols enable much lower CPU overhead for the database server. When the database is viewed as a bit sequence, only addition operations are performed by the database server. The security of the general version of our protocol depends on either a Hidden Modular Group Order (HMGO) assumption, (a new assumption), or sender anonymity, and we present two specialized protocols, each of which depends on one of the two assumptions, respectively. For our trapdoor group protocol, we assume (the HMGO assumption) that given only the elements be1, ..., bet in the group Zm, where ei m/t and t is small, it is hard to compute the group order m. One version of our cPIR protocol depends only on sender anonymity, which to our knowledge, is the first cPIR protocol to depend only on an anonymity assumption. Our prototype implementation shows that our performance compares favorably with existing cPIR protocols.