Oblivious data structures

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2014, Pages 215-226

  Wang, Xiao Shaun ^a   Nayak, Kartik ^a   Liu, Chang ^a   Chan, T H Hubert ^b   Shi, Elaine ^a   Stefanov, Emil ^c   Huang, Yan ^d  

^a UNIVERSITY OF MARYLAND   (United States)

^b HKU   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d INDIANA UNIVERSITY   (United States)

Author keywords

Cryptography; Oblivious algorithms; Security

Indexed keywords

CRYPTOGRAPHY; DATA STRUCTURES; FLOW GRAPHS;

DATA ACCESS PATTERNS; DOUBLING DIMENSIONS; EFFICIENT DATA STRUCTURES; MEMORY ALLOCATORS; NOVEL TECHNIQUES; OBLIVIOUS ALGORITHMS; SECURITY; WEIGHTED PLANAR GRAPHS; BUILDING BLOCKES;

GRAPH ALGORITHMS;

EID: 84910678637     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2660267.2660314     Document Type: Conference Paper

References (56)

1. Hardware AES showdown-via padlock vs intel AES-NI vs AMD hexacore. http://grantmcwilliams.com/tech/technology/item/532-hardware-aes-showdown-via-padlock-vs-intel-aes-ni-vsamd-hexacore.
2. Askarov, A., Zhang, D., and Myers, A. C. Predictive black-box mitigation of timing channels. In CCS (2010), pp. 297-307.
3. Assouad, P. Plongements lipschitziens dans Rn. Bull. Soc. Math. France 111, 4 (1983), 429-448.
4. Bar-Yossef, Z., and Gurevich, M. Random sampling from a search engine's index. J. ACM (2008).
5. Bellare, M., Hoang, V. T., Keelveedhi, S., and Rogaway, P. Efficient garbling from a fixed-key blockcipher. In S & P (2013).
6. Berg, M. d., Cheong, O., Kreveld, M. v., and Overmars, M.computational Geometry: Algorithms and Applications. 2008.
7. Blanton, M., Steele, A., and Aliasgari, M. Data-oblivious graph algorithms for secure computation and outsourcing. In ASIACCS (2013).
8. Blelloch, G. E., and Golovin, D. Strongly history-independent hashing with applications. In FOCS (2007).
9. Chung, K.-M., Liu, Z., and Pass, R. Statistically-secure oram with O(log2 n) overhead. http://arxiv.org/abs/1307.3699, 2013.
10. Clarkson, K. L. Nearest neighbor queries in metric spaces. Discrete Comput. Geom. 22, 1 (1999), 63-93.
11. Damgård, I., Meldgaard, S., and Nielsen, J. B. Perfectly secure oblivious RAM without random oracles. In TCC (2011).
12. Eppstein, D., Goodrich, M. T., and Tamassia, R. Privacy-preserving data-oblivious geometric algorithms for geographic data. In GIS (2010).
13. Fletcher, C. W., Dijk, M. v., and Devadas, S. A secure processor architecture for encrypted computation on untrusted programs. In STC (2012).
14. Ford, Jr., L. R., and Fulkerson, D. R. Maximal ow through a network. In Canadian Journal of Mathematics (1956).
15. Gentry, C., Goldman, K. A., Halevi, S., Jutla, C. S., Raykova, M., and Wichs, D. Optimizing ORAM and using it efficiently for secure computation. In PETS (2013).
16. Goldreich, O. Towards a theory of software protection and simulation by oblivious RAMs. In STOC (1987).
17. Goldreich, O., and Ostrovsky, R. Software protection and simulation on oblivious RAMs. J. ACM (1996).
18. Goodrich, M. T., and Mitzenmacher, M. Privacy-preserving access of outsourced data via oblivious RAM simulation. In ICALP (2011).
19. Goodrich, M. T., Mitzenmacher, M., Ohrimenko, O., and Tamassia, R. Oblivious RAM simulation with efficient worst-case access overhead. In CCSW (2011).
20. Goodrich, M. T., Mitzenmacher, M., Ohrimenko, O., and Tamassia, R. Practical oblivious storage. In CODASPY (2012).
21. Goodrich, M. T., Mitzenmacher, M., Ohrimenko, O., and Tamassia, R. Privacy-preserving group data access via stateless oblivious RAM simulation. In SODA (2012).
22. Goodrich, M. T., Ohrimenko, O., and Tamassia, R. Data-oblivious graph drawing model and algorithms. CoRR abs/1209.0756 (2012).
23. Gordon, S. D., Katz, J., Kolesnikov, V., Krell, F., Malkin, T., Raykova, M., and Vahlis, Y. Secure two-party computation in sublinear (amortized) time. In CCS (2012).
24. Gupta, A., Krauthgamer, R., and Lee, J. R. Bounded geometries, fractals, and low-distortion embeddings. In FOCS (2003), pp. 534-543.
25. Huang, Y., Evans, D., Katz, J., and Malka, L. Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium (2011).
26. Islam, M., Kuzu, M., and Kantarcioglu, M. Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In NDSS (2012).
27. Keller, M., and Scholl, P. Efficient, oblivious data structures for mpc. Cryptology ePrint Archive, Report 2014/137, 2014. http://eprint.iacr.org/.
28. Kushilevitz, E., Lu, S., and Ostrovsky, R. On the (in)security of hash-based oblivious RAM and a new balancing scheme. In SODA (2012).
29. Lipton, R. J., and Tarjan, R. E. A Separator Theorem for Planar Graphs. SIAM Journal on Applied Mathematics (1979).
30. Liu, C., Hicks, M., and Shi, E. Memory trace oblivious program execution. In CSF (2013).
31. Liu, C., Huang, Y., Shi, E., Katz, J., and Hicks, M. Automating efficient RAM-model secure computation. In IEEE S & P (May 2014).
32. Lu, S., and Ostrovsky, R. Distributed oblivious RAM for secure two-party computation. In TCC (2013).
33. Lu, S., and Ostrovsky, R. How to garble ram programs. In EUROCRYPT (2013).
34. Maas, M., Love, E., Stefanov, E., Tiwari, M., Shi, E., Asanovic, K., Kubiatowicz, J., and Song, D. Phantom: Practical oblivious computation in a secure processor. In CCS (2013).
35. Micciancio, D. Oblivious data structures: applications to cryptography. In STOC (1997), ACM.
36. Mitchell, J. C., and Zimmerman, J. Data-Oblivious Data Structures. In STACS (2014).
37. Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N., and Boneh, D. Privacy-preserving matrix factorization. In CCS (2013).
38. Ostrovsky, R., and Shoup, V. Private information storage (extended abstract). In STOC (1997).
39. Pippenger, N., and Fischer, M. J. Relations among complexity measures. In J. ACM (1979).
40. Ren, L., Fletcher, C., Yu, X., Kwon, A., van Dijk, M., and Devadas, S. Unified oblivious-ram: Improving recursive oram with locality and pseudorandomness. Cryptology ePrint Archive, Report 2014/205, 2014. http://eprint.iacr.org/.
41. Shi, E., Chan, T.-H. H., Stefanov, E., and Li, M. Oblivious RAM with O((logN)3) worst-case cost. In ASIACRYPT (2011).
42. Stefanov, E., and Shi, E. Oblivistore: High performance oblivious cloud storage. In IEEE Symposium on Security and Privacy (S & P) (2013).
43. Stefanov, E., Shi, E., and Song, D. Towards practical oblivious RAM. In NDSS (2012).
44. Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., and Devadas, S. Path ORAM-an extremely simple oblivious ram protocol. In CCS (2013).
45. Suh, G. E., Clarke, D., Gassend, B., van Dijk, M., and Devadas, S. Aegis: architecture for tamper-evident and tamper-resistant processing. In ICS (2003).
46. Thekkath, D. L. C., Mitchell, M., Lincoln, P., Boneh, D., Mitchell, J., and Horowitz, M. Architectural support for copy and tamper resistant software. SIGOPS Oper. Syst. Rev. (2000).
47. Toft, T. Secure data structures based on multi-party computation. In PODC (2011), pp. 291-292.
48. Wang, X. S., Nayak, K., Liu, C., Chan, T.-H. H., Shi, E., Stefanov, E., and Huang, Y. Oblivious data structures. Cryptology ePrint Archive, Report 2014/185, 2014. http://eprint.iacr.org/.
49. Williams, P., and Sion, R. Usable PIR. In NDSS (2008).
50. Williams, P., and Sion, R. Round-optimal access privacy on outsourced storage. In CCS (2012).
51. Williams, P., Sion, R., and Carbunar, B. Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In CCS (2008).
52. Williams, P., Sion, R., and Tomescu, A. Privatefs: A parallel oblivious file system. In CCS (2012).
53. Zahur, S., and Evans, D. Circuit structures for improving efficiency of security and privacy tools. In S & P (2013).
54. Zhang, D., Askarov, A., and Myers, A. C. Predictive mitigation of timing channels in interactive systems. In CCS (2011), pp. 563-574.
55. Zhang, D., Askarov, A., and Myers, A. C. Language-based control and mitigation of timing channels. In PLDI (2012), pp. 99-110.
56. Zhuang, X., Zhang, T., and Pande, S. Hide: an infrastructure for efficiently protecting information leakage on the address bus. SIGARCH Comput. Archit. News 32, 5 (Oct. 2004), 72-84.