An Efficient and Practical Scheme for Privacy Protection in the E-Commerce of Digital Goods
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Using a High-Performance, Programmable Secure Coprocessor
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Probabilistic Analysis of Anonymity
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
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
Practical server privacy with secure coprocessors
IBM Systems Journal - End-to-end security
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Almost optimal private information retrieval
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
On preserving privacy in content-oriented networks
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Privacy-Preserving search and updates for outsourced tree-structured data on untrusted servers
iTrust'05 Proceedings of the Third international conference on Trust Management
| Hi-index | 0.00 |
Privacy is preserved while retrieving an i-th record from the database of N records if no information is revealed about i, not even to the database server. Repudiation is preserved in the same model if no one can prove, even in cooperation with the server, that a record retrieved is or is not the j-th record for any 1 ≤ j ≤ N. The first problem is called PIR, and we call the second problem the RIR problem.State of the art PIR protocols with optimal query response time and optimal communication require heavy periodical preprocessing. O(N log N) I/O's are required for preprocessing before answering a query.In this paper, we reduce preprocessing complexity by weakening PIR to RIR. In particular, we propose a RIR protocol with optimal query response time and communication, and O (√N) preprocessing per query.