ObliVM: A programming framework for secure computation

Proceedings - IEEE Symposium on Security and Privacy

Volumn 2015-July, Issue , 2015, Pages 359-376

  Liu, Chang ^a   Wang, Xiao Shaun ^a   Nayak, Kartik ^a   Huang, Yan ^b   Shi, Elaine ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

Compiler; Oblivious Algorithms; Oblivious RAM; Programming Language; Secure Computation; Type System

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; GRAPH ALGORITHMS; PROBLEM ORIENTED LANGUAGES; PROGRAM COMPILERS;

COMPETITIVE PERFORMANCE; COMPILER; CRYPTOGRAPHIC ALGORITHMS; DOMAIN SPECIFIC LANGUAGES; OBLIVIOUS ALGORITHMS; PROGRAMMING ABSTRACTIONS; SECURE COMPUTATION; TYPE SYSTEMS;

DATA MINING;

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

References (60)

1. A. C.-C. Yao, "Protocols for secure computations (extended abstract)," in FOCS, 1982.
2. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game," in STOC, 1987.
3. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank, "Extending Oblivious Transfers Efficiently," in CRYPTO 2003, 2003.
4. M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway, "Efficient Garbling from a Fixed-Key Blockcipher," in S & P, 2013.
5. V. Kolesnikov and T. Schneider, "Improved Garbled Circuit: Free XOR Gates and Applications," in ICALP, 2008.
6. S. G. Choi, J. Katz, R. Kumaresan, and H.-S. Zhou, "On the security of the "free-xor" technique," in TCC, 2012.
7. B. Applebaum, "Garbling xor gates "for free" in the standard model," in TCC, 2013.
8. G. Asharov, Y. Lindell, T. Schneider, and M. Zohner, "More Efficient Oblivious Transfer and Extensions for Faster Secure Computation," ser. CCS '13, 2013.
9. D. Bogdanov, S. Laur, and J. Willemson, "Sharemind: A Framework for Fast Privacy-Preserving Computations," in ESORICS, 2008.
10. B. Kreuter, B. Mood, A. Shelat, and K. Butler, "PCF: A portable circuit format for scalable two-party secure computation," in Usenix Security, 2013.
11. B. Kreuter, a. shelat, and C.-H. Shen, "Billion-gate secure computation with malicious adversaries," in USENIX Security, 2012.
12. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, "Fairplay: a secure two-party computation system," in USENIX Security, 2004.
13. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg, "Tasty: tool for automating secure two-party computations," in CCS, 2010.
14. Y. Zhang, A. Steele, and M. Blanton, "PICCO: a general-purpose compiler for private distributed computation," in CCS, 2013.
15. C. Liu, Y. Huang, E. Shi, J. Katz, and M. Hicks, "Automating Efficient RAM-model Secure Computation," in S & P, May 2014.
16. A. Holzer, M. Franz, S. Katzenbeisser, and H. Veith, "Secure Two-party Computations in ANSI C," in CCS, 2012.
17. A. Rastogi, M. A. Hammer, and M. Hicks, "Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations," in S & P, 2014.
18. "Partisia," http://www.partisia.dk/.
19. "Dyadic security," http://www.dyadicsec.com/.
20. R. Canetti, "Security and composition of multiparty cryptographic protocols," Journal of Cryptology, 2000.
21. C. Liu, X. S. Wang, M. Hicks, and E. Shi, "Formalizing the ObliVM language," Manuscript in preparation, 2015.
22. M. T. Goodrich and J. A. Simons, "Data-Oblivious Graph Algorithms in Outsourced External Memory," CoRR, vol. abs/1409.0597, 2014.
23. J. Brickell and V. Shmatikov, "Privacy-preserving graph algorithms in the semi-honest model," in ASIACRYPT, 2005.
24. K. Nayak, X. S. Wang, S. Ioannidis, U. Weinsberg, N. Taft, and E. Shi, "GraphSC: Parallel Secure Computation Made Easy," in IEEE S & P, 2015.
25. V. Nikolaenko, S. Ioannidis, U. Weinsberg, M. Joye, N. Taft, and D. Boneh, "Privacy-preserving matrix factorization," in CCS, 2013.
26. X. S. Wang, K. Nayak, C. Liu, T.-H. H. Chan, E. Shi, E. Stefanov, and Y. Huang, "Oblivious Data Structures," in CCS, 2014.
27. M. Keller and P. Scholl, "Efficient, oblivious data structures for MPC," in Asiacrypt, 2014.
28. J. C. Mitchell and J. Zimmerman, "Data-Oblivious Data Structures," in STACS, 2014, pp. 554-565.
29. 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.
30. "Rsa distributed credential protection," http://www.emc.com/security/rsa-distributed-credential-protection.htm.
31. C. Liu, M. Hicks, and E. Shi, "Memory trace oblivious program execution," ser. CSF '13, 2013, pp. 51-65.
32. S. D. Gordon, A. McIntosh, J. Katz, E. Shi, and X. S. Wang, "Secure computation of MIPS machine code," Manuscript, 2015.
33. Y. Huang, D. Evans, J. Katz, and L. Malka, "Faster secure two-party computation using garbled circuits," in Usenix Security Symposium, 2011.
34. E. M. Songhori, S. U. Hussain, A.-R. Sadeghi, T. Schneider, and F. Koushanfar, "TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits," in IEEE S & P, 2015.
35. A. C.-C. Yao, "How to generate and exchange secrets," in FOCS, 1986.
36. M. Naor, B. Pinkas, and R. Sumner, "Privacy preserving auctions and mechanism design," ser. EC '99, 1999.
37. S. Zahur, M. Rosulek, and D. Evans, "Two halves make a whole: Reducing data transfer in garbled circuits using half gates," in EUROCRYPT, 2015.
38. C. Gentry, "Fully homomorphic encryption using ideal lattices," in STOC, 2009.
39. ~elaine/docs/oblivmtr.pdf.
40. O. Goldreich and R. Ostrovsky, "Software protection and simulation on oblivious RAMs," J. ACM, 1996.
41. O. Goldreich, "Towards a theory of software protection and simulation by oblivious RAMs," in STOC, 1987.
42. 3) worst-case cost," in ASIACRYPT, 2011.
43. J. Agat, "Transforming out timing leaks," in POPL, 2000.
44. A. Russo, J. Hughes, D. A. Naumann, and A. Sabelfeld, "Closing internal timing channels by transformation," in ASIAN, 2006.
45. M. T. Goodrich and M. Mitzenmacher, "Privacy-preserving access of outsourced data via oblivious RAM simulation," in ICALP, 2011.
46. D. Dachman-Soled, C. Liu, C. Papamanthou, E. Shi, and U. Vishkin, "Oblivious network RAM," Cryptology ePrint Archive, Report 2015/073, 2015, http://eprint.iacr.org/.
47. 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.
48. "Graphlab," http://graphlab.org.
49. M. Blanton, A. Steele, and M. Alisagari, "Data-oblivious graph algorithms for secure computation and outsourcing," in ASIA CCS, 2013.
50. A. A. Karatsuba, "The Complexity of Computations," 1995.
51. X. S. Wang, Y. Huang, T.-H. H. Chan, A. Shelat, and E. Shi, "SCO-RAM: Oblivious RAM for Secure Computation," in CCS, 2014.
52. V. Nikolaenko, U. Weinsberg, S. Ioannidis, M. Joye, D. Boneh, and N. Taft, "Privacy-preserving ridge regression on hundreds of millions of records," in S & P, 2013.
53. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2001.
54. "Private communication," 2014.
55. M. Naor and B. Pinkas, "Efficient oblivious transfer protocols," in SODA, 2001.
56. http://humangenomeprivacy.org/2015.
57. N. A. Jagadeesan, R. Pal, K. Nadikuditi, Y. Huang, E. Shi, and M. Yu, "A secure computation framework for SDNs," in HotSDN, 2014.
58. X. S. Wang, C. Liu, K. Nayak, Y. Huang, and E. Shi, "idash secure genome analysis competition using oblivm," Cryptology ePrint Archive, Report 2015/191, 2015, http://eprint.iacr.org/.
59. J. Wagner, J. Paulson, X. S. Wang, H. Corrada-Bravo, and B. Bhat-tacharjee, "Privacy-preserving human microbiome analysis using secure computation," Manuscript, 2015.
60. E. Kushilevitz, S. Lu, and R. Ostrovsky, "On the (in)security of hash-based oblivious RAM and a new balancing scheme," in SODA, 2012.