GraphSC: Parallel secure computation made easy

Proceedings - IEEE Symposium on Security and Privacy

Volumn 2015-July, Issue , 2015, Pages 377-394

  Nayak, Kartik ^a   Wang, Xiao Shaun ^a   Ioannidis, Stratis ^b   Weinsberg, Udi ^c   Taft, Nina ^d   Shi, Elaine ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b YAHOO INC   (United States)

^c FACEBOOK   (United States)

^d GOOGLE INC   (United States)

Author keywords

graph algorithms; oblivious algorithms; parallel algorithms; secure computation

Indexed keywords

CRYPTOGRAPHY; DATA MINING; FACTORIZATION; GRAPH ALGORITHMS; GRAPHIC METHODS; LARGE DATASET; MACHINE LEARNING; PARALLEL ALGORITHMS; PARALLEL PROGRAMMING;

COMMUNICATION OVERHEADS; GRAPH-BASED ALGORITHMS; MATRIX FACTORIZATIONS; OBLIVIOUS ALGORITHMS; PARALLEL PROGRAMMING PARADIGMS; PROGRAMMING PARADIGMS; SECURE COMPUTATION; SECURE IMPLEMENTATION;

LEARNING ALGORITHMS;

EID: 84945191638     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2015.30     Document Type: Conference Paper

References (78)

1. A. C.-C. Yao, "How to generate and exchange secrets," in FOCS, 1986.
2. C. Liu, Y. Huang, E. Shi, J. Katz, and M. Hicks, "Automating efficient ram-model secure computation," in IEEE S & P, 2014.
3. V. Nikolaenko, S. Ioannidis, U. Weinsberg, M. Joye, N. Taft, and D. Boneh, "Privacy-preserving matrix factorization," in ACM CCS, 2013.
4. V. Nikolaenko, U. Weinsberg, S. Ioannidis, M. Joye, D. Boneh, and N. Taft, "Privacy-preserving ridge regression on hundreds of millions of records," in IEEE (S & P), 2013.
5. Y. Huang, D. Evans, J. Katz, and L. Malka, "Faster secure two-party computation using garbled circuits." in USENIX Security Symposium, 2011.
6. B. Kreuter, a. shelat, and C.-H. Shen, "Billion-gate secure computation with malicious adversaries," in USENIX Security symposium, 2012.
7. J. Dean and S. Ghemawat, "Mapreduce: Simplified data processing on large clusters," Commun. ACM, 2008.
8. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, "Pregel: A system for large-scale graph processing," in SIGMOD, 2010.
9. Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein, "Distributed graphlab: a framework for machine learning and data mining in the cloud," PVLDB, 2012.
10. M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, "Spark: cluster computing with working sets," in HotCloud, 2010.
11. X. S. Wang, C. Liu, K. Nayak, Y. Huang, and E. Shi, "Oblivm: A programming framework for secure computation," IEEE Symposium on Security and Privacy (S & P), 2015.
12. J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin, "Powergraph: Distributed graph-parallel computation on natural graphs." in OSDI, 2012.
13. E. Boyle, K.-M. Chung, and R. Pass, "Oblivious parallel ram," https://eprint.iacr.org/2014/594, 2014.
14. M. T. Goodrich, O. Ohrimenko, and R. Tamassia, "Data-oblivious graph drawing model and algorithms," CoRR, 2012.
15. D. Eppstein, M. T. Goodrich, and R. Tamassia, "Privacy-preserving data-oblivious geometric algorithms for geographic data," in SIGSPA-TIAL, 2010.
16. S. Zahur and D. Evans, "Circuit structures for improving efficiency of security and privacy tools," in S & P, 2013.
17. M. Blanton, A. Steele, and M. Alisagari, "Data-oblivious graph algorithms for secure computation and outsourcing," in ASIA CCS. ACM, 2013.
18. A. C.-C. Yao, "Protocols for secure computations (extended abstract)," in FOCS, 1982.
19. 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 ACM CCS, 2012.
20. a. shelat and C.-H. Shen, "Fast two-party secure computation with minimal assumptions," in CCS, 2013.
21. -, "Two-output secure computation with malicious adversaries." in EUROCRYPT, 2011.
22. F. Kerschbaum, "Automatically optimizing secure computation," in CCS, 2011.
23. D. Bogdanov, S. Laur, and J. Willemson, "Sharemind: A framework for fast privacy-preserving computations.
24. B. Kreuter, B. Mood, A. Shelat, and K. Butler, "PCF: A portable circuit format for scalable two-party secure computation," in USENIX Security, 2013.
25. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, "Fairplay: a secure two-party computation system," in USENIX Security Symposium, 2004.
26. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg, "Tasty: tool for automating secure two-party computations," in CCS, 2010.
27. A. Rastogi, M. A. Hammer, and M. Hicks, "Wysteria: A programming language for generic, mixed-mode multiparty computations," in IEEE Symposium on Security and Privacy (S & P), 2014.
28. A. Holzer, M. Franz, S. Katzenbeisser, and H. Veith, "Secure two-party computations in ansi c," in CCS, 2012.
29. Y. Zhang, A. Steele, and M. Blanton, "Picco: a general-purpose compiler for private distributed computation," in CCS, 2013.
30. V. Kolesnikov and T. Schneider, "Improved Garbled Circuit: Free XOR Gates and Applications," in ICALP, 2008.
31. S. G. Choi, J. Katz, R. Kumaresan, and H.-S. Zhou, "On the security of the "free-xor" technique," in Theory of Cryptography Conference (TCC), 2012.
32. B. Applebaum, "Garbling xor gates "for free" in the standard model," in Theory of Cryptography Conference (TCC), 2013.
33. N. Husted, S. Myers, A. Shelat, and P. Grubbs, "Gpu and cpu par-allelization of honest-but-curious secure two-party computation," in Annual Computer Security Applications Conference, 2013.
34. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game," in STOC, 1987.
35. C. Gentry, "Fully homomorphic encryption using ideal lattices," in ACM symposium on Theory of computing (STOC), 2009.
36. I. Damgård, M. Keller, E. Larraia, V. Pastro, P. Scholl, and N. P. Smart, "Practical covertly secure mpc for dishonest majority-or: Breaking the spdz limits," in Computer Security-ESORICS 2013, 2013.
37. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," in ACM STOC, 1988.
38. O. Goldreich and R. Ostrovsky, "Software protection and simulation on oblivious RAMs," J. ACM, 1996.
39. M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia, "Privacy-preserving group data access via stateless oblivious RAM simulation," in SODA, 2012.
40. R. Ostrovsky and V. Shoup, "Private information storage (extended abstract)," in ACM Symposium on Theory of Computing (STOC), 1997.
41. E. Kushilevitz, S. Lu, and R. Ostrovsky, "On the (in)security of hash-based oblivious RAM and a new balancing scheme," in SODA, 2012.
42. M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia, "Oblivious RAM simulation with efficient worst-case access overhead," in CCSW, 2011.
43. I. Damgård, S. Meldgaard, and J. B. Nielsen, "Perfectly secure oblivious RAM without random oracles," in TCC, 2011.
44. 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, Tech. Rep., 2011.
45. P. Williams, R. Sion, and B. Carbunar, "Building castles out of mud: Practical access pattern privacy and correctness on untrusted storage," in CCS, 2008.
46. P. Williams and R. Sion, "Usable PIR," in Network and Distributed System Security Symposium (NDSS), 2008.
47. M. T. Goodrich and M. Mitzenmacher, "Privacy-preserving access of outsourced data via oblivious RAM simulation," in ICALP, 2011.
48. R. Ostrovsky, "Efficient computation on oblivious RAMs," in ACM Symposium on Theory of Computing (STOC), 1990.
49. B. Pinkas and T. Reinman, "Oblivious RAM revisited," in CRYPTO, 2010.
50. P. Williams and R. Sion, "SR-ORAM: Single round-trip oblivious ram," in ACM CCS, 2012.
51. 3) worst-case cost," in ASIACRYPT, 2011.
52. E. Stefanov, M. van Dijk, E. Shi, C. Fletcher, L. Ren, X. Yu, and S. De-vadas, "Path ORAM-an extremely simple oblivious ram protocol," in CCS, 2013.
53. X. S. Wang, T.-H. H. Chan, and E. Shi, "Circuit oram: On tightness of the goldreich-ostrovsky lower bound," Cryptology ePrint Archive, Report 2014/672, 2014, http://eprint.iacr.org/.
54. 2n) overhead," CoRR, 2013.
55. X. Wang, K. Nayak, C. Liu, E. Shi, E. Stefanov, and Y. Huang, "Oblivious data structures," in ACM CCS, 2014.
56. J. C. Mitchell and J. Zimmerman, "Data-Oblivious Data Structures," in Theoretical Aspects of Computer Science (STACS), 2014.
57. J. E. Savage, Models of Computation: Exploring the Power of Computing, 1997.
58. K. Shvachko, H. Kuang, S. Radia, and R. Chansler, "The hadoop distributed file system," in Mass Storage Systems and Technologies (MSST), 2010 IEEE 26th Symposium on. IEEE, 2010, pp. 1-10.
59. C. Avery, "Giraph: Large-scale graph processing infrastruction on hadoop," Hadoop Summit., 2011.
60. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Computer networks and ISDN systems, 1998.
61. Y Koren, R. Bell, and C. Volinsky, "Matrix factorization techniques for recommender systems," Computer, vol. 42, no. 8, pp. 30-37, 2009.
62. D. E. Rumelhart, G. E. Hinton, and R. J. Williams, "Learning representations by back-propagating errors," Cognitive modeling, vol. 5, 1988.
63. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, "Distributed optimization and statistical learning via the alternating direction method of multipliers," Foundations and Trends® in Machine Learning, 2011.
64. D. E. Knuth, The Art of Computer Programming, Volume 3: (2Nd Ed.) Sorting and Searching, 1998.
65. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein et al, Introduction to algorithms. MIT press Cambridge, 2001.
66. M. Ajtai, J. Komlós, and E. Szemerédi, "An o(n log n) sorting network," in ACM symposium on Theory of computing, 1983.
67. R. Miller and L. Boxer, Algorithms sequential & parallel: A unified approach. Cengage Learning, 2012.
68. Y Lindell and B. Pinkas, "An efficient protocol for secure two-party computation in the presence of malicious adversaries," in EUROCRYPT, 2007.
69. J. Bennett and S. Lanning, "The netflix prize," in Proceedings of KDD cup and workshop, 2007.
70. "Oblivm," http://www.oblivm.com.
71. M. T. Goodrich, "Zig-zag sort: A simple deterministic data-oblivious sorting algorithm running in o(n log n) time," CoRR, 2014.
72. "Graphlab powergraph tutorials," https://github.com/graphlab-code/graphlab.
73. "Movielens dataset," http://grouplens.org/datasets/movielens/.
74. S. Bhagat, U. Weinsberg, S. Ioannidis, and N. Taft, "Recommending with an agenda: Active learning of private attributes using matrix factorization," in RecSys '14. ACM.
75. S. Ioannidis, A. Montanari, U. Weinsberg, S. Bhagat, N. Fawaz, and N. Taft, "Privacy tradeoffs in predictive analytics," in SIGMETRICS'14. ACM, 2014.
76. M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway, "Efficient garbling from a fixed-key blockcipher," in IEEE Symposium on Security and Privacy (SP), 2013.
77. "Tc man page," http://manpages.ubuntu.com/manpages//karmic/man8/tc.8.html.
78. "Iperf," https://iperf.fr/.