Randomized algorithms
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Journal of Algorithms
Querying Databases Privately: A New Approach To Private Information Retrieval.
Querying Databases Privately: A New Approach To Private Information Retrieval.
Building castles out of mud: practical access pattern privacy and correctness on untrusted storage
Proceedings of the 15th ACM conference on Computer and communications security
A new paradigm for collision-free hashing: incrementality at reduced cost
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Advances on access-driven cache attacks on AES
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Practical Oblivious Outsourced Storage
ACM Transactions on Information and System Security (TISSEC)
Oblivious RAM simulation with efficient worst-case access overhead
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Private information retrieval using trusted hardware
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Revisiting the computational practicality of private information retrieval
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
Single round access privacy on outsourced storage
Proceedings of the 2012 ACM conference on Computer and communications security
PrivateFS: a parallel oblivious file system
Proceedings of the 2012 ACM conference on Computer and communications security
| Hi-index | 0.00 |
We introduce a new practical mechanism for remote data storage with access pattern privacy and correctness. A storage client can deploy this mechanism to issue encrypted reads, writes, and inserts to a potentially curious and malicious storage service provider, without revealing information or access patterns. The provider is unable to establish any correlation between successive accesses, or even to distinguish between a read and a write. Moreover, the client is provided with strong correctness assurances for its operations—illicit provider behavior does not go undetected. We describe a practical system that can execute an unprecedented several queries per second on terabyte-plus databases while maintaining full computational privacy and correctness.