Automating efficient RAM-model secure computation

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2014, Pages 623-638

  Liu, Chang ^a   Huang, Yan ^a   Shi, Elaine ^a   Katz, Jonathan ^a   Hicks, Michael ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCUIT SIMULATION;

AUTOMATED APPROACH; CIRCUIT MODELING; COMPILE TIME; INHERENT LIMITATIONS; INTERMEDIATE REPRESENTATIONS; RAM MODEL; SECURE COMPUTATION; TYPE SYSTEMS;

CRYPTOGRAPHY;

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

References (32)

1. J. Agat. Transforming out timing leaks. In POPL, 2000.
2. B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In In POPL, 1988.
3. A. Askarov, S. Hunt, A. Sabelfeld, and D. Sands. Termination in sensitive noninterference leaks more than just a bit. In ESORICS, 2008.
4. M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway. Efficient garbling from a fixed-key blockcipher. In IEEE S & P, 2013.
5. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 2000.
6. H. Carter, B. Mood, P. Traynor, and K. Butler. Secure outsourced garbled circuit evaluation for mobile devices. In USENIX Security, 2013.
7. COMPCERT: Compilers you can formally trust. http://compcert. inria.fr/.
8. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. J. ACM, May 1996.
9. M. T. Goodrich and M. Mitzenmacher. Privacy-preserving access of outsourced data via oblivious RAM simulation. In ICALP, 2011.
10. 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, 2012.
11. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. Tasty: Tool for automating secure two-party computations. In CCS, 2010.
12. A. Holzer, M. Franz, S. Katzenbeisser, and H. Veith. Secure two-party computations in ANSI C. In CCS, 2012.
13. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure twoparty computation using garbled circuits. In USENIX Security, 2011.
14. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In CRYPTO, 2003.
15. F. Kerschbaum. Automatically optimizing secure computation. In CCS, 2011.
16. B. Kreuter, B. Mood, A. Shelat, and K. Butler. PCF: A portable circuit format for scalable two-party secure computation. In USENIX Security, 2013.
17. E. Kushilevitz, S. Lu, and R. Ostrovsky. On the (in)security of hash-based oblivious RAM and a new balancing scheme. In SODA, 2012.
18. C. Liu, M. Hicks, and E. Shi. Memory trace oblivious program execution. In CSF, 2013.
19. C. Liu, Y. Huang, E. Shi, J. Katz, and M. Hicks. Automating efficient RAM-model secure computation. Technical Report CS-TR-5033, University of Maryland, Department of Computer Science, Mar. 2014.
20. S. Lu and R. Ostrovsky. How to garble RAM programs. In EUROCRYPT, 2013.
21. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay: A secure two-party computation system. In USENIX Security, 2004.
22. P. Mardziel, M. Hicks, J. Katz, and M. Srivatsa. Knowledgeoriented secure multiparty computation. In PLAS, 2012.
23. D. Molnar, M. Piotrowski, D. Schultz, and D. Wagner. The program counter security model: Automatic detection and removal of control-flow side channel attacks. In ICISC, 2005.
24. A. Rastogi, M. A. Hammer, and M. Hicks. Wysteria: A programming language for generic, mixed-mode multiparty computations. In IEEE S & P, 2014.
25. A. Rastogi, P. Mardziel, M. Hammer, and M. Hicks. Knowledge inference for optimizing secure multi-party computation. In PLAS, 2013.
26. A. Sabelfeld and A. C. Myers. Language-based informationflow security. IEEE Journal on Selected Areas in Communications, 2003.
27. 3) worst-case cost. In ASIACRYPT, 2011.
28. 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.
29. A. Waksman. A permutation network. J. ACM, 15, 1968.
30. P. Williams, R. Sion, and B. Carbunar. Building castles out of mud: Practical access pattern privacy and correctness on untrusted storage. In CCS, 2008.
31. A. C.-C. Yao. How to generate and exchange secrets. In FOCS, 1986.
32. S. Zahur and D. Evans. Circuit structures for improving efficiency of security and privacy tools. In S & P, 2013.