Knowledge-oriented secure multiparty computation

PLAS'12 - Proceedings of Programming Languages and Analysis for Security

Volumn , Issue , 2012, Pages

  Mardziel, Piotr ^a   Hicks, Michael ^a   Katz, Jonathan ^a   Srivatsa, Mudhakar ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

D.2.0 Software Engineering : Protection Mechanisms; Language; Security

Indexed keywords

KNOWLEDGE-ORIENTED; LANGUAGE; PROTECTION MECHANISMS; SECURE MULTI-PARTY COMPUTATION; SECURITY; TRACKING METHOD;

COMPUTER PROGRAMMING LANGUAGES; SOFTWARE ENGINEERING;

CRYPTOGRAPHY;

EID: 84865295525     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2336717.2336719     Document Type: Conference Paper

References (12)

1. Amos Beimel, Kobbi Nissim, and Eran Omri. Distributed private data analysis: Simultaneously solving how and what. In Advances in Cryptology - Crypto 2008, volume 5157 of LNCS, pages 451-468. Springer, 2008.
2. Michael R. Clarkson, Andrew C. Myers, and Fred B. Schneider. Quantifying information flow with beliefs. J. Comput. Secur., 17(5), 2009.
3. Cynthia Dwork. Differential privacy. In 33rd Intl. Colloquium on Automata, Languages, and Programming (ICALP), Part II, volume 4052 of LNCS, pages 1-12. Springer, 2006.
4. Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor. Our data, ourselves: Privacy via distributed noise generation. In Advances in Cryptology - Eurocrypt 2006, volume 4004 of LNCS, pages 486-503. Springer, 2006.
5. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In 3rd Theory of Cryptography Conference - TCC 2006, volume 3876 of LNCS, pages 265-284. Springer, 2006.
6. O. Goldreich. Foundations of Cryptography, vol. 2: Basic Applications. Cambridge University Press, Cambridge, UK, 2004.
7. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game, or a completeness theorem for protocols with honest majority. In 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218-229. ACM Press, 1987.
8. Yan Huang, David Evans, Jonathan Katz, and Lior Malka. Faster secure two-party computation using garbled circuits. In USENIX Security, 2011.
9. Krishnaram Kenthapadi, Nina Mishra, and Kobbi Nissim. Simulatable auditing. In PODS, 2005.
10. Y. Lindell and B. Pinkas. Secure multiparty computation for privacy-preserving data mining. J. Privacy and Confidentiality, 1(1):59-98, 2009.
11. Piotr Mardziel, Stephen Magill, Michael Hicks, and Mudhakar Srivatsa. Dynamic enforcement of knowledge-based security policies. In Proceedings of the Computer Security Foundations Symposium (CSF), June 2011.
12. A. C.-C. Yao. How to generate and exchange secrets. In 27th Annual Symposium on Foundations of Computer Science (FOCS), pages 162-167. IEEE, 1986.