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
Querying Databases Privately: A New Approach To Private Information Retrieval.
Querying Databases Privately: A New Approach To Private Information Retrieval.
Private information retrieval using trusted hardware
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Secure anonymous database search
Proceedings of the 2009 ACM workshop on Cloud computing security
Data protection in outsourcing scenarios: issues and directions
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Enabling search services on outsourced private spatial data
The VLDB Journal — The International Journal on Very Large Data Bases
Blindfold: a system to "See no evil" in content discovery
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Regulatory compliant oblivious RAM
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
RASP: efficient multidimensional range query on attack-resilient encrypted databases
Proceedings of the first ACM conference on Data and application security and privacy
Practical Oblivious Outsourced Storage
ACM Transactions on Information and System Security (TISSEC)
Privacy-preserving access of outsourced data via oblivious RAM simulation
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Private database search with sublinear query time
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
A comprehensive framework for secure query processing on relational data in the cloud
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
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
A light-weight solution to preservation of access pattern privacy in un-trusted clouds
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Supporting concurrency in private data outsourcing
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Oblivious RAM simulation with efficient worst-case access overhead
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
On the (in)security of hash-based oblivious RAM and a new balancing scheme
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Privacy-preserving group data access via stateless oblivious RAM simulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the second ACM conference on Data and Application Security and Privacy
Oblivious RAM with o((logn)3) worst-case cost
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Oblivious outsourced storage with delegation
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
Secure data management in the cloud
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Secure multidimensional range queries over outsourced data
The VLDB Journal — The International Journal on Very Large Data Bases
Single round access privacy on outsourced storage
Proceedings of the 2012 ACM conference on Computer and communications security
Secure two-party computation in sublinear (amortized) time
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
Distributed oblivious RAM for secure two-party computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Data-oblivious graph algorithms for secure computation and outsourcing
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Path ORAM: an extremely simple oblivious RAM protocol
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Practical dynamic proofs of retrievability
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
PHANTOM: practical oblivious computation in a secure processor
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Access privacy and correctness on untrusted storage
ACM Transactions on Information and System Security (TISSEC)
Inference attack against encrypted range queries on outsourced databases
Proceedings of the 4th ACM conference on Data and application security and privacy
Efficient privacy-aware search over encrypted databases
Proceedings of the 4th ACM conference on Data and application security and privacy
Supporting concurrency and multiple indexes in private access to outsourced data
Journal of Computer Security - Research in Computer Security and Privacy: Emerging Trends
Shroud: ensuring private access to large-scale data in the data center
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
We introduce a new practical mechanism for remote data storage with efficient 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 built a first practical system -- orders of magnitude faster than existing implementations -- that can execute over several queries per second on 1Tbyte+ databases with full computational privacy and correctness.