Knowledge inference for optimizing secure multi-party computation

PLAS 2013 - Proceedings of the 2013 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security, Co-located with PLDI 2013

Volumn , Issue , 2013, Pages 3-14

  Rastogi, Aseem ^a   Mardziel, Piotr ^a   Hicks, Michael ^a   Hammer, Matthew A ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Information flow; Program verification; Secure multi party computation

Indexed keywords

SECURITY OF DATA;

CRYPTOGRAPHIC TECHNIQUES; EXPERIMENTAL EVALUATION; INFORMATION FLOWS; LEARN+; PRIVATE DATA; PROGRAM VERIFICATION; PROPERTY; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION;

CRYPTOGRAPHY;

EID: 84890726242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2465106.2465117     Document Type: Conference Paper

References (24)

1. PPL: Parma polyhedral library. www.cs.unipr.it/ppl.
2. Z3 theorem prover. research.microsoft.com/en-us/um/redmond/projects/z3.
3. G. Aggarwal, N. Mishra, and B. Pinkas. Secure computation of the k th-ranked element. In EUROCRYPT. Springer, 2004.
4. G. Barthe, P. R. D'Argenio, and T. Rezk. Secure information flow by self-composition. In CSFW, 2004.
5. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In STOC, 1990.
6. A. Ben-David, N. Nisan, and B. Pinkas. FairplayMP: A system for secure multi-party computation. In CCS, 2008.
7. S. Chong. Required information release. In CSF, 2010.
8. M. R. Clarkson and F. B. Schneider. Hyperproperties. In CSF, 2008.
9. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programming, 1976.
10. V. Ganesh and D. L. Dill. A decision procedure for bit-vectors and arrays. In CAV, 2007.
11. O. Goldreich, S.Micali, and A.Wigderson. How to play ANY mental game. In STOC, 1987.
12. S. Gulwani, S. Srivastava, and R. Venkatesan. Program analysis as constraint solving. In PLDI, 2008.
13. Y. Huang, P. Chapman, and D. Evans. Privacy-preserving applications on smartphones. In HOTSEC, 2011.
14. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure twoparty computation using garbled circuits. In USENIX Security, 2011.
15. F. Kerschbaum. Automatically optimizing secure computation. In CCS, 2011.
16. J. C. King. Symbolic execution and program testing. Commun. ACM, 19(7):385-394, 1976.
17. LLVM. http://llvm.org.
18. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay: A secure two-party computation system. In USENIX Security, 2004.
19. F. Pottier and V. Simonet. Information flow inference for ML. ACM TOPLAS, 25(1):117-158, Jan. 2003.
20. A. Sabelfeld and A. C. Myers. Language-based informationflow security. IEEE JSAC, 2003.
21. A. Sabelfeld and A. C. Myers. A model for delimited information release. In International Symp. on Software Security, 2004.
22. S. Srivastava and S. Gulwani. Program verification using templates over predicate abstraction. In PLDI, 2009.
23. A. C.-C. Yao. How to generate and exchange secrets. In FOCS, 1986.
24. S. Zdancewic, L. Zheng, N. Nystrom, and A. C. Myers. Untrusted hosts and confidentiality: secure program partitioning. In SOSP, 2001.