Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Private information storage (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
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
The IBM PCIXCC: a new cryptographic coprocessor for the IBM eServer
IBM Journal of Research and Development
Protecting Client Privacy with Trusted Computing at the Server
IEEE Security and Privacy
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Private information retrieval using trusted hardware
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Secure coprocessor-based private information retrieval without periodical preprocessing
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
Reconstruction of falsified computer logs for digital forensics investigations
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
Practical Oblivious Outsourced Storage
ACM Transactions on Information and System Security (TISSEC)
Private information retrieval with a trusted hardware unit - revisited
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Hi-index | 0.00 |
For a private information retrieval (PIR) scheme to be deployed in practice, low communication complexity and low computation complexity are two fundamental requirements it must meet. Most existing PIR schemes only focus on the communication complexity. The reduction on the computational complexity did not receive the due treatment mainly because of its O(n) lower bound. By using the trusted hardware based model, we design a novel scheme which breaks this barrier. With constant storage, the computation complexity of our scheme, including offline computation, is linear to the number of queries and is bounded by ${\mathrm{O}}(\sqrt{n})$ after optimization.