Data-oblivious graph algorithms for secure computation and outsourcing

ASIA CCS 2013 - Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security

Volumn , Issue , 2013, Pages 207-218

  Blanton, Marina ^a   Steele, Aaron ^a   Alisagari, Mehrdad ^a  

^a University of Notre Dame   (United States)

Author keywords

graph algorithms; oblivious execution; secure computation

Indexed keywords

ASYMPTOTIC COMPLEXITY; BREADTH-FIRST SEARCH; DATA-OBLIVIOUS ALGORITHMS; GRAPH ALGORITHMS; GRAPH PROBLEMS; MINIMUM SPANNING TREES; OBLIVIOUS EXECUTION; SECURE COMPUTATION;

ALGORITHMS; CRYPTOGRAPHY; FLOW GRAPHS; OPTIMIZATION;

SECURITY OF DATA;

EID: 84877998963     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2484313.2484341     Document Type: Conference Paper

References (41)

1. M. Ajtai. Oblivious RAMs without cryptographic assumptions. In STOC, pages 181-190, 2010.
2. L. Arge, M. Bender, E. Demaine, B. Holland-Minkley, and J. Munro. Cache-oblivious priority queue and graph algorithm applications. In STOC, pages 268-276, 2002.
3. L. Arge, M. Bender, E. Demaine, B. Holland-Minkley, and J. Munro. An optimal cache-oblivious priority queue and its application to graph algorithms. SIAM Journal on Computing, pages 1672-1695, 2007.
4. M. Atallah, K. Frikken, and S. Wang. Private outsourcing of matrix multiplication over closed semi-rings. In SECRYPT, pages 136-144, 2012.
5. M. Blanton and E. Aguiar. Private and oblivious set and multiset operations. In ASIACCS, 2012.
6. M. Blanton, M. Atallah, K. Frikken, and Q. Malluhi. Secure and efficient outsourcing of sequence comparisons. In ESORICS, pages 505-522, 2012.
7. D. Boneh, D. Mazieres, and R. Popa. Remote oblivious storage: Making oblivious RAM practical. Technical Report MIT-CSAIL-TR-2011-018, MIT, 2011.
8. J. Brickell and V. Shmatikov. Privacy-preserving graph algorithms in the semi-honest model. In ASIACRYPT, pages 236-252, 2005.
9. G. Brodal. Cache-oblivious algorithms and data structures. In SWAT, pages 3-13, 2004.
10. G. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In SWAT, pages 480-492, 2004.
11. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylog communication. In EUROCRYPT, pages 402-414, 1999.
12. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
13. O. Catrina and S. de Hoogh. Improved primitives for secure multiparty integer computation. In SCN, pages 182-199, 2010.
14. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In FOCS, pages 41-50, 1995.
15. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. Journal of the ACM, pages 965-981, 1998.
16. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to algorithms. The MIT Press, 2009.
17. I. Damgård, S. Meldgaard, and J. Nielsen. Perfectly secure oblivious RAM without random oracles. In TCC, pages 144-163, 2011.
18. D. Eppstein, M. Goodrich, and R. Tamassia. \Privacy-preserving data-oblivious geometric algorithms for geographic data. In GIS, pages 13-22, 2010.
19. C. Erway, A. Kupcu, C. Papamanthou, and R. Tamassia. Dynamic provable data possession. In CCS, pages 213-222, 2009.
20. P. Failla. Heuristic search in encrypted graphs. In SECURWARE, pages 82-87, 2010.
21. K.B. Frikken and P. Golle. Private social network analysis: how to assemble pieces of a graph privately. In ACM Workshop on Privacy in the Electronic Society (WPES), pages 89-98, 2006.
22. C. Gentry and Z. Ramzan. Single-database private information retrieval with constant communication rate. In ICALP, pages 803-815, 2005.
23. O. Goldreich. Towards a theory of software protection and simulation by oblivious RAMs. In STOC, pages 182-194, 1987.
24. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM, 43(3):431-473, 1996. (Pubitemid 126607640)
25. M. Goodrich. Randomized Shellsort: A simple oblivious sorting algorithm. In SODA, pages 1262-1277, 2010.
26. M. Goodrich. Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. In SPAA, pages 379-388, 2011.
27. M. Goodrich and M. Mitzenmacher. Privacy-preserving access of outsourced data via oblivious RAM simulation. In ICALP, pages 576-587, 2011.
28. M. Goodrich, O. Ohrimenko, and R. Tamassia. Data-oblivious graph drawing model and algorithms. Arxiv preprint arXiv:1209:0756, 2012.
29. E. Kushilevitz, S. Lu, and R. Ostrovsky. On the (in) security of hash-based oblivious RAM and a new balancing scheme. In SODA, pages 143-156, 2012.
30. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In FOCS, pages 364-373, 1997.
31. H. Lipmaa. An oblivious transfer protocol with log-squared total communication. In Information Security Conference (ISC), pages 314-328, 2005.
32. K. Mouratidis and M. Yiu. Shortest path computation with no information leakage. VLDB Endowment, 5(8):692-703, 2012.
33. R. Ostrovsky. Efficient computation on oblivious RAMs. In STOC, pages 514-523, 1990.
34. B. Pinkas and T. Reinman. Oblivious RAM revisited. In CRYPTO, pages 502-519, 2010.
35. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
36. 3) worst-case cost. In ASIACRYPT, pages 197-214, 2011.
37. E. Stefanov, E. Shi, and D. Song. Towards practical oblivious RAM. In Network and Distributed System Security Symposium (NDSS), 2012.
38. S. Wang, X. Ding, R. Deng, and F. Bao. Private information retrieval using trusted hardware. In ESORICS, pages 49-64, 2006.
39. P. Williams and R. Sion. Usable PIR. In Network and Distributed System Security Symposium (NDSS), 2008.
40. P. Williams, R. Sion, and B. Carbunar. Building castles out of mud: Practical access pattern privacy and correctness on untrusted storage. In CCS, pages 139-148, 2008.
41. A. Yao. How to generate and exchange secrets. In FOCS, pages 162-167, 1986.