Towards a theory of software protection and simulation by oblivious RAMs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Oblivious RAMs without cryptogrpahic assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Secure data structures based on multi-party computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Privacy-preserving distributed network troubleshooting—bridging the gap between theory and practice
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
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
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
GD'12 Proceedings of the 20th international conference on Graph Drawing
Distributed oblivious RAM for secure two-party computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Memory access pattern protection for resource-constrained devices
CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
Practically efficient multi-party sorting protocols from comparison sort algorithms
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
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
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
We present an algorithm for implementing a secure oblivious RAM where the access pattern is perfectly hidden in the information theoretic sense, without assuming that the CPU has access to a random oracle. In addition we prove a lower bound on the amount of randomness needed for implementing an information theoretically secure oblivious RAM.