research-article

Knowledge-oriented secure multiparty computation

Authors:

Piotr Mardziel,

Michael Hicks,

Jonathan Katz,

Mudhakar SrivatsaAuthors Info & Claims

PLAS '12: Proceedings of the 7th Workshop on Programming Languages and Analysis for Security

Article No.: 2, Pages 1 - 12

https://doi.org/10.1145/2336717.2336719

Published: 15 June 2012 Publication History

Get Access

Abstract

Protocols for secure multiparty computation (SMC) allow a set of mutually distrusting parties to compute a function f of their private inputs while revealing nothing about their inputs beyond what is implied by the result. Depending on f, however, the result itself may reveal more information than parties are comfortable with. Almost all previous work on SMC treats f as given. Left unanswered is the question of how parties should decide whether it is "safe" for them to compute f in the first place.

We propose here a way to apply belief tracking to SMC in order to address exactly this question. In our approach, each participating party is able to reason about the increase in knowledge that other parties could gain as a result of computing f, and may choose not to participate (or participate only partially) so as to restrict that gain in knowledge. We develop two techniques---the belief set method and the SMC belief tracking method---prove them sound, and discuss their precision/performance tradeoffs using a series of experiments.

References

[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.

Digital Library

Google Scholar

[2]

Michael R. Clarkson, Andrew C. Myers, and Fred B. Schneider. Quantifying information flow with beliefs. J. Comput. Secur., 17(5), 2009.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[6]

O. Goldreich. Foundations of Cryptography, vol. 2: Basic Applications. Cambridge University Press, Cambridge, UK, 2004.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[8]

Yan Huang, David Evans, Jonathan Katz, and Lior Malka. Faster secure two-party computation using garbled circuits. In USENIX Security, 2011.

Digital Library

Google Scholar

[9]

Krishnaram Kenthapadi, Nina Mishra, and Kobbi Nissim. Simulatable auditing. In PODS, 2005.

Digital Library

Google Scholar

[10]

Y. Lindell and B. Pinkas. Secure multiparty computation for privacy-preserving data mining. J. Privacy and Confidentiality, 1(1):59--98, 2009.

Crossref

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

Cited By

View all

Uplavikar NVaidya JLin DJiang W(2020)Privacy-Preserving Friend Recommendation in an Integrated Social EnvironmentInformation Systems Security10.1007/978-3-030-65610-2_8(117-136)Online publication date: 6-Dec-2020
https://doi.org/10.1007/978-3-030-65610-2_8
Lu YZhu M(2018)Privacy preserving distributed optimization using homomorphic encryptionAutomatica10.1016/j.automatica.2018.07.00596(314-325)Online publication date: Oct-2018
https://doi.org/10.1016/j.automatica.2018.07.005
Wu GHe YWu JXia X(2016)Inherit Differential Privacy in Distributed Setting: Multiparty Randomized Function Computation2016 IEEE Trustcom/BigDataSE/ISPA10.1109/TrustCom.2016.0157(921-928)Online publication date: Aug-2016
https://doi.org/10.1109/TrustCom.2016.0157
Show More Cited By

Index Terms

Knowledge-oriented secure multiparty computation
1. Security and privacy
  1. Software and application security
    1. Software security engineering
2. Software and its engineering
  1. Software organization and properties
    1. Software functional properties
      1. Correctness
        Access protection

Recommendations

Zero-knowledge from secure multiparty computation
STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

We present a general construction of a zero-knowledge proof for an NP relation R(x,w) which only makes a black-box use of a secure protocol for a related multi-partyfunctionality f. The latter protocol is only required to be secure against a small ...
Zero-Knowledge Proofs from Secure Multiparty Computation

A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multiparty computation allows $n$ mutually suspicious players to jointly compute a ...
Two-round Multiparty Secure Computation from Minimal Assumptions
We provide new two-round multiparty secure computation (MPC) protocols in the dishonest majority setting assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest ...

Comments

Information & Contributors

Information

Published In

PLAS '12: Proceedings of the 7th Workshop on Programming Languages and Analysis for Security

June 2012

91 pages

ISBN:9781450314411

DOI:10.1145/2336717

Conference Chairs:
Sergio Maffeis
Imperial College London
,
Tamara Rezk
INRIA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 June 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

PLDI '12

Sponsor:

SIGPLAN

PLDI '12: ACM SIGPLAN Conference on Programming Language Design and Implementation

June 15, 2012

Beijing, China

Acceptance Rates

Overall Acceptance Rate 43 of 77 submissions, 56%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
182
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Uplavikar NVaidya JLin DJiang W(2020)Privacy-Preserving Friend Recommendation in an Integrated Social EnvironmentInformation Systems Security10.1007/978-3-030-65610-2_8(117-136)Online publication date: 6-Dec-2020
https://doi.org/10.1007/978-3-030-65610-2_8
Lu YZhu M(2018)Privacy preserving distributed optimization using homomorphic encryptionAutomatica10.1016/j.automatica.2018.07.00596(314-325)Online publication date: Oct-2018
https://doi.org/10.1016/j.automatica.2018.07.005
Wu GHe YWu JXia X(2016)Inherit Differential Privacy in Distributed Setting: Multiparty Randomized Function Computation2016 IEEE Trustcom/BigDataSE/ISPA10.1109/TrustCom.2016.0157(921-928)Online publication date: Aug-2016
https://doi.org/10.1109/TrustCom.2016.0157
Tarameshloo EFong PMohassel PBertino ESandhu RPark J(2014)On protection in federated social computing systemsProceedings of the 4th ACM conference on Data and application security and privacy10.1145/2557547.2557555(75-86)Online publication date: 3-Mar-2014
https://dl.acm.org/doi/10.1145/2557547.2557555
Mardziel PMagill SHicks MSrivatsa M(2013)Dynamic enforcement of knowledge-based security policies using probabilistic abstract interpretationJournal of Computer Security10.5555/2590624.259062521:4(463-532)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.5555/2590624.2590625
Dagdelen ÖMohassel PVenturi D(2013)Rate-Limited Secure Function Evaluation: Definitions and ConstructionsPublic-Key Cryptography – PKC 201310.1007/978-3-642-36362-7_28(461-478)Online publication date: 2013
https://doi.org/10.1007/978-3-642-36362-7_28
Mironov I(2012)Differential privacy as a protocol constraint2012 IEEE Information Theory Workshop10.1109/ITW.2012.6404769(81-83)Online publication date: Sep-2012
https://doi.org/10.1109/ITW.2012.6404769
De Cristofaro EGasti PTsudik G(2012)Fast and Private Computation of Cardinality of Set Intersection and UnionCryptology and Network Security10.1007/978-3-642-35404-5_17(218-231)Online publication date: 2012
https://doi.org/10.1007/978-3-642-35404-5_17

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Zero-knowledge from secure multiparty computation

Zero-Knowledge Proofs from Secure Multiparty Computation

Two-round Multiparty Secure Computation from Minimal Assumptions

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations