SCORAM: Oblivious RAM for secure computation

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2014, Pages 191-202

  Wang, Xiao Shaun ^a   Huang, Yan ^b   Chan, T H Hubert ^c   Shelat, Abhi ^d   Shi, Elaine ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b INDIANA UNIVERSITY   (United States)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

^d UNIVERSITY OF VIRGINIA   (United States)

Author keywords

Oblivious RAM; Secure computation

Indexed keywords

ASYMPTOTIC ANALYSIS; CRYPTOGRAPHY;

BANDWIDTH OVERHEADS; CIRCUIT COMPLEXITY; CIRCUIT SIZE; DATA SIZE; FAILURE PROBABILITY; MEMORY SIZE; SECURE COMPUTATION;

RANDOM ACCESS STORAGE;

EID: 84910613463     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2660267.2660365     Document Type: Conference Paper

References (40)

1. A. Ben-David, N. Nisan, and B. Pinkas. FairplayMP: A System for Secure Multi-party Computation. In ACM Conference on Computer and Communications Security, 2008.
2. D. Boneh, D. Mazieres, and R. A. Popa. Remote oblivious storage: Making oblivious RAM practical. http://dspace.mit.edu/bitstream/handle/1721.1/62006/MIT-CSAIL-TR-2011-018.pdf, 2011.
3. K.-M. Chung, Z. Liu, and R. Pass. Statistically-secure oram with O(log2 n) overhead. arXiv preprint arXiv:1307.3699, 2013.
4. I. Damgård, S. Meldgaard, and J. B. Nielsen. Perfectly secure oblivious RAM without random oracles. In TCC, 2011.
5. C. W. Fletcher, M. v. Dijk, and S. Devadas. A secure processor architecture for encrypted computation on untrusted programs. In STC, 2012.
6. C. Gentry, K. A. Goldman, S. Halevi, C. S. Jutla, M. Raykova, and D. Wichs. Optimizing ORAM and using it efficiently for secure computation. In Privacy Enhancing Technologies Symposium (PETS), 2013.
7. O. Goldreich. Towards a theory of software protection and simulation by oblivious RAMs. In STOC, 1987.
8. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In ACM symposium on Theory of computing (STOC), 1987.
9. M. T. Goodrich and M. Mitzenmacher. Privacy-preserving access of outsourced data via oblivious RAM simulation. In ICALP, 2011.
10. M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Oblivious RAM simulation with efficient worst-case access overhead. In CCSW, 2011.
11. M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Privacy-preserving group data access via stateless oblivious RAM simulation. In SODA, 2012.
12. S. D. Gordon, J. Katz, V. Kolesnikov, F. Krell, T. Malkin, M. Raykova, and Y. Vahlis. Secure two-party computation in sublinear (amortized) time. In CCS, pages 513-524, 2012.
13. M. Harchol-Balter. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press, 2013.
14. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium, 2011.
15. M. Keller and P. Scholl. Efficient, oblivious data structures for mpc. Cryptology ePrint Archive, Report 2014/137, 2014. http://eprint.iacr.org/.
16. B. Kreuter, B. Mood, A. Shelat, and K. Butler. PCF: A Portable Circuit Format for Scalable Two-Party Secure Computation. In USENIX Security Symposium, 2013.
17. B. Kreuter, A. Shelat, and C. hao Shen. Billion-Gate Secure Computation with Malicious Adversaries. In USENIX Security Symposium, 2012.
18. E. Kushilevitz, S. Lu, and R. Ostrovsky. On the (in)security of hash-based oblivious RAM and a new balancing scheme. In SODA, 2012.
19. C. Liu, Y. Huang, E. Shi, J. Katz, and M. Hicks. Automating efficient ram-model secure computation. IEEE S & P, 2014.
20. S. Lu and R. Ostrovsky. Distributed oblivious ram for secure two-party computation. In Proceedings of the 10th Theory of Cryptography Conference on Theory of Cryptography, TCC'13, pages 377-396, Berlin, Heidelberg, 2013. Springer-Verlag.
21. M. Maas, E. Love, E. Stefanov, M. Tiwari, E. Shi, K. Asanovic, J. Kubiatowicz, and D. Song. Phantom: Practical oblivious computation in a secure processor. In CCS, 2013.
22. P. MacKenzie, A. Oprea, and M. Reiter. Automatic Generation of Two-party Computations. In ACM Conference on Computer and Communications Security, 2003.
23. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay: A secure two-party computation system. In USENIX Security, 2004.
24. J. C. Mitchell and J. Zimmerman. Data-Oblivious Data Structures. In STACS 2014, pages 554-565, 2014.
25. V. Nikolaenko, S. Ioannidis, U. Weinsberg, M. Joye, N. Taft, and D. Boneh. Privacy-preserving matrix factorization. In CCS, pages 801-812, 2013.
26. R. Ostrovsky. Efficient computation on oblivious RAMs. In STOC, 1990.
27. R. Ostrovsky and V. Shoup. Private information storage (extended abstract). In STOC, 1997.
28. B. Pinkas and T. Reinman. Oblivious RAM revisited. In CRYPTO, 2010.
29. A. Rastogi, M. A. Hammer, and M. Hicks. Wysteria: A programming language for generic, mixed-mode multiparty computations. IEEE S & P, 2014.
30. E. Shi, T.-H. H. Chan, E. Stefanov, and M. Li. Oblivious RAM with O((logN)3) worst-case cost. In ASIACRYPT, 2011.
31. E. Stefanov and E. Shi. Fastprp: Fast pseudo-random permutations for small domains. Cryptology ePrint Archive, 2012. http://eprint.iacr.org/.
32. E. Stefanov and E. Shi. Multi-cloud oblivious storage. In CCS, 2013.
33. E. Stefanov and E. Shi. Oblivistore: High performance oblivious cloud storage. In IEEE Symposium on Security and Privacy (S & P), 2013.
34. E. Stefanov, M. van Dijk, E. Shi, C. Fletcher, L. Ren, X. Yu, and S. Devadas. Path ORAM: an extremely simple oblivious ram protocol. In In CCS, 2013.
35. X. S. Wang, T.-H. H. Chan, and E. Shi. Circuit ORAM and on tightness of the goldreich-ostrovsky lower bound. Manuscript, 2014.
36. X. S. Wang, K. Nayak, C. Liu, T.-H. H. Chan, E. Shi, E. Stefanov, and Y. Huang. Oblivious data structures. In CCS, 2014.
37. P. Williams and R. Sion. Usable PIR. In NDSS, 2008.
38. P. Williams and R. Sion. Round-optimal access privacy on outsourced storage. In CCS, 2012.
39. P. Williams, R. Sion, and B. Carbunar. Building castles out of mud: Practical access pattern privacy and correctness on untrusted storage. In CCS, 2008.
40. A. C.-C. Yao. How to generate and exchange secrets. In FOCS, 1986.