Data-oblivious data structures

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 25, Issue , 2014, Pages 554-565

  Mitchell, John C ^a   Zimmerman, Joe ^a  

^a Stanford University   (United States)

Author keywords

Data oblivious algorithms; Data oblivious data structures; Oblivious RAM; Secure cloud computing; Secure multi party computation

Indexed keywords

CLOUD COMPUTING; DATA STRUCTURES; RANDOM ACCESS STORAGE;

CONSTANT FACTORS; DATA COMPACTION; DATA-OBLIVIOUS ALGORITHMS; FULLY HOMOMORPHIC ENCRYPTION; MEMORY ACCESS PATTERNS; PRIORITY QUEUES; SECURE CLOUD COMPUTING; SECURE MULTI-PARTY COMPUTATION;

CRYPTOGRAPHY;

EID: 84907811852     PISSN: 18688969     EISSN: None     Source Type: Book    
DOI: 10.4230/LIPIcs.STACS.2014.554     Document Type: Conference Paper

References (18)

1. Paul Beame and Widad Machmouchi. Making branching programs oblivious requires superlogarithmic overhead. In IEEE Conference on Computational Complexity, pages 12-22. IEEE Computer Society, 2011.
2. Paul Beame and Widad Machmouchi. Making RAMs oblivious requires superlogarithmic overhead. ECCC, 2011.
3. Ivan Damgård, Sigurd Meldgaard, and Jesper Buus Nielsen. Perfectly secure Oblivious RAM without random oracles. In Yuval Ishai, editor, TCC, volume 6597 of Lecture Notes in Computer Science, pages 144-163. Springer, 2011.
4. David Eppstein, Michael T. Goodrich, and Roberto Tamassia. Privacy-preserving dataoblivious geometric algorithms for geographic data. In Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS '10, pages13-22, New York, NY, USA, 2010. ACM.
5. Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. Real-time simulation of multihead tape units. J. ACM, 19(4):590-607, October 1972.
6. Craig Gentry, Kenny A. Goldman, Shai Halevi, Charanjit S. Jutla, Mariana Raykova, and Daniel Wichs. Optimizing ORAM and using it efficiently for secure computation. In Emiliano De Cristofaro and Matthew Wright, editors, Privacy Enhancing Technologies, volume 7981 of Lecture Notes in Computer Science, pages 1-18. Springer, 2013.
7. Oded Goldreich and Rafail Ostrovsky. Software protection and simulation on oblivious RAMs. J. ACM, 43(3):431-473, May 1996.
8. Michael T. Goodrich. Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, SPAA '11, pages 379-388, New York, NY, USA, 2011. ACM.
9. F. C. Hennie and R. E. Stearns. Two-tape simulation of multitape turing machines. J. ACM, 13(4):533-546, October 1966.
10. Eyal Kushilevitz, Steve Lu, and Rafail Ostrovsky. On the (in)security of hash-based oblivious RAM and a new balancing scheme. In Yuval Rabani, editor, SODA, pages 143-156. SIAM, 2012.
11. Benton L. Leong and Joel I. Seiferas. New real-time simulations of multihead tape units. J. ACM, 28(1):166-180, January 1981.
12. Daniele Micciancio. Oblivious data structures: applications to cryptography. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, STOC '97, pages 456-464, New York, NY, USA, 1997. ACM.
13. John C. Mitchell, Rahul Sharma, Deian Stefan, and Joe Zimmerman. Information-flow control for programming on encrypted data. In Computer Security Foundations Symposium (CSF), 2012 IEEE 25th, pages 45-60. IEEE, June 2012.
14. Andrew C. Myers and Barbara Liskov. Protecting privacy using the decentralized label model. ACM Trans. Softw. Eng. Methodol., 9(4):410-442, October 2000.
15. Benny Pinkas and Tzachy Reinman. Oblivious RAM revisited. In Proceedings of the 30th annual conference on Advances in cryptology, CRYPTO'10, pages 502-519, Berlin, Heidelberg, 2010. Springer-Verlag.
16. Nicholas Pippenger and Michael J. Fischer. Relations among complexity measures. J. ACM, 26(2):361-381, April 1979.
17. Emil Stefanov, Marten van Dijk, Elaine Shi, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas. Path oram: An extremely simple oblivious RAM protocol. IACR Cryptology ePrint Archive, 2013:280, 2013.
18. Tomas Toft. Secure data structures based on multi-party computation. In Cyril Gavoille and Pierre Fraigniaud, editors, PODC, pages 291-292. ACM, 2011.