How to Bypass Two Anonymity Revocation Schemes
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Location privacy based on trusted computing and secure logging
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Authenticated error-correcting codes with applications to multicast authentication
ACM Transactions on Information and System Security (TISSEC)
Privacy-preserving queries over relational databases
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Achieving efficient query privacy for location based services
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Scalable anonymous communication with provable security
HotSec'10 Proceedings of the 5th USENIX conference on Hot topics in security
Practical Oblivious Outsourced Storage
ACM Transactions on Information and System Security (TISSEC)
PIR-Tor: scalable anonymous communication using private information retrieval
SEC'11 Proceedings of the 20th USENIX conference on Security
Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
Practical PIR for electronic commerce
Proceedings of the 18th ACM conference on Computer and communications security
Private search in the real world
Proceedings of the 27th Annual Computer Security Applications Conference
Revisiting the computational practicality of private information retrieval
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
A historical probability based noise generation strategy for privacy protection in cloud computing
Journal of Computer and System Sciences
A trust-based noise injection strategy for privacy protection in cloud
Software—Practice & Experience
A Time-Series Pattern Based Noise Generation Strategy for Privacy Protection in Cloud Computing
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Optimally robust private information retrieval
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Outsourced private information retrieval
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Batch proofs of partial knowledge
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
Since 1995, much work has been done creating protocols for private information retrieval (PIR). Many variants of the basic PIR model have been proposed, including such modifications as computational vs. information-theoretic privacy protection, correctness in the face of servers that fail to respond or that respond incorrectly, and protection of sensitive data against the database servers themselves. In this paper, we improve on the robustness of PIR in a number of ways. First, we present a Byzantine-robust PIR protocol which provides information-theoretic privacy protection against coalitions of up to all but one of the responding servers, improving the previous result by a factor of 3. In addition, our protocol allows for more of the responding servers to return incorrect information while still enabling the user to compute the correct result. We then extend our protocol so that queries have information-theoretic protection if a limited number of servers collude, as before, but still retain computational protection if they all collude. We also extend the protocol to provide information-theoretic protection to the contents of the database against collusions of limited numbers of the database servers, at no additional communication cost or increase in the number of servers. All of our protocols retrieve a block of data with communication cost only O(.) times the size of the block, where . is the number of servers.