Article

Leveraging the "Multi" in secure multi-party computation

Authors:

Jaideep Vaidya,

Chris CliftonAuthors Info & Claims

WPES '03: Proceedings of the 2003 ACM workshop on Privacy in the electronic society

Pages 53 - 59

https://doi.org/10.1145/1005140.1005149

Published: 30 October 2003 Publication History

Abstract

Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in sensitive data on networked computers, along with improved ability to integrate and utilize that data, make the time ripe for practical secure multi-party computation. This paper surveys approaches to secure multi-party computation, and gives a method whereby an efficient protocol for two parties using an untrusted third party can be used to construct an efficient peer-to-peer secure multi-party protocol.

References

[1]

R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, San Diego, California, June 9-12 2003.]]

Digital Library

[2]

M. J. Atallah and W. Du. Secure multi-party computational geometry. In Seventh International Workshop on Algorithms and Data Structures (WADS 2001), Providence, Rhode Island, USA, Aug. 8-10 2001. {Online}. Available: http://www.cerias.purdue.edu/homes/duw/research/paper/wads2001.ps]]

Digital Library

[3]

D. Beaver. Commodity-based cryptography (extended abstract). In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. ACM Press, 1997, pages 446--455.]]

Digital Library

[4]

D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proceedings of the 20th ACM Symposium on the Theory of Computing. ACM Press, 1988, pages 11--19.]]

Digital Library

[5]

W. Du and Z. Zhan. A practical approach to solve secure multi-party computation problems. In Proceedings of New Security Paradigms Workshop, Virginia Beach, virginia, USA, September 23-26 2002.]]

Digital Library

[6]

W. Du and M. J. Atallah. Privacy-preserving cooperative scientific computations. In 14th IEEE Computer Security Foundations Workshop, Nova Scotia, Canada, June 11-13 2001, pages 273--282. {Online}. Available: http://portal.acm.org]]

Digital Library

[7]

W. Du and M. J. Atallah. Privacy-preserving statistical analysis. In Proceeding of the 17th Annual Computer Security Applications Conference, New Orleans, Louisiana, USA, December 10-14 2001. {Online}. Available: http://www.cerias.purdue.edu/ homes/duw/research/paper/acsac2001.ps]]

Digital Library

[8]

W. Du and M. J. Atallah. Secure multi-party computation problems and their applications: A review and open problems. In New Security Paradigms Workshop, Cloudcroft, New Mexico, USA, September 11-13 2001, pages 11--20. {Online}. Available: http://www.cerias.purdue.edu/homes/duw/research/paper/nspw2001.ps]]

Digital Library

[9]

W. Du and Z. Zhan. Building decision tree classifier on private data. In IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, C. Clifton and V. Estivill-Castro, Eds., vol. 14. Maebashi City, Japan: Australian Computer Society, Dec. 9 2002, pages 1--8. {Online}. Available: http://www.jrpit.flinders.edu.au/CRPITVolume14.html]]

Digital Library

[10]

O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In 19th ACM Symposium on the Theory of Computing, 1987, pages 218--229. {Online}. Available: http://doi.acm.org/10.1145/28395.28420]]

Digital Library

[11]

O. Goldreich. Secure multi-party computation. Sept. 1998, (working draft). {Online}. Available: http://www.wisdom.weizmann.ac.il/~oded/pp.html]]

[12]

I. Ioannidis, A. Grama, and M. Atallah. A secure protocol for computing dot-products in clustered and distributed environments. In The 2002 International Conference on Parallel Processing, Vancouver, British Columbia, Aug. 18-21 2002.]]

Digital Library

[13]

M. Kantarcioglu and J. Vaidya. An architecture for privacy-preserving mining of client information. In IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, C. Clifton and V. Estivill-Castro, Eds., vol. 14. Maebashi City, Japan: Australian Computer Society, Dec. 9 2002, pages 37--42. {Online}. Available: http://crpit.com/Vol14.html]]

Digital Library

[14]

M. Kantarcioǧlu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowledge Data Eng., to appear.]]

Digital Library

[15]

Y. Lindell and B. Pinkas. Privacy preserving data mining. In Advances in Cryptology -- CRYPTO 2000. Springer-Verlag, Aug. 20-24 2000, pages 36--54. {Online}. Available: http://link.springer.de/link/service/series/0558/bibs/1880/18800036.htm]]

Digital Library

[16]

M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, July 6-8 2001. {Online}. Available: http://doi.acm.org/10.1145/380752.380855]]

Digital Library

[17]

M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proceedings of the 1st ACM Conference on Electronic Commerce. ACM Press, 1999.]]

Digital Library

[18]

R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120--126, 1978. {Online}. Available: http://doi.acm.org/10.1145/359340.359342]]

Digital Library

[19]

B. Schneier, Applied Cryptography, 2nd ed. John Wiley & Sons, 1995.]]

[20]

J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23-26 2002, pages 639--644. {Online}. Available: http://doi.acm.org/10.1145/775047.775142]]

Digital Library

[21]

J. Vaidya and C. Clifton. Secure set intersection cardinality with application to association rule mining. ACM Transactions on Information Systems Security, submitted.]]

[22]

A. C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science. IEEE, 1986, pages 162--167.]]

Digital Library

Cited By

Gupta BHan CChaurasia P(2024)Privacy-Preserving Techniques and User Anonymity in the MetaverseMetaverse Security Paradigms10.4018/979-8-3693-3824-7.ch012(304-317)Online publication date: 21-Aug-2024
https://doi.org/10.4018/979-8-3693-3824-7.ch012
Fenner JGaleas PEscobar FNeira R(2024)Secure IoT Communication: Implementing a One-Time Pad Protocol with True Random Numbers and Secure Multiparty SumsApplied Sciences10.3390/app1412535414:12(5354)Online publication date: 20-Jun-2024
https://doi.org/10.3390/app14125354
Yigzaw KMichalas ABellika J(2017)Secure and scalable deduplication of horizontally partitioned health data for privacy-preserving distributed statistical computationBMC Medical Informatics and Decision Making10.1186/s12911-016-0389-x17:1Online publication date: 3-Jan-2017
https://doi.org/10.1186/s12911-016-0389-x
Show More Cited By

Index Terms

Leveraging the "Multi" in secure multi-party computation
1. Applied computing
  1. Electronic commerce
    1. Secure online transactions
2. Security and privacy
  1. Human and societal aspects of security and privacy
  2. Software and application security
    1. Domain-specific security and privacy architectures

Recommendations

Secure Multi-Party Computation without Agreement

It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of ...
Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation
Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. In particular, we consider MFE scenarios where at the end of the protocol, either every participant ...
Round-Optimal Secure Multi-Party Computation
Advances in Cryptology – CRYPTO 2018
Abstract
Secure multi-party computation (MPC) is a central cryptographic task that allows a set of mutually distrustful parties to jointly compute some function of their private inputs where security should hold in the presence of a malicious adversary ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WPES '03: Proceedings of the 2003 ACM workshop on Privacy in the electronic society

October 2003

135 pages

ISBN:1581137761

DOI:10.1145/1005140

General Chair:
Sushil Jajodia
George Mason University
,
Program Chairs:
Pierangela Samarati
University of Milan, Italy
,
Paul Syverson
Naval Research Lab

Copyright © 2003 ACM.

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]

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 October 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CCS03

Sponsor:

SIGSAC

CCS03: Tenth ACM Conference on Computer and Communications Security 2003

30 10 2003

Washington, DC

Acceptance Rates

Overall Acceptance Rate 106 of 355 submissions, 30%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
572
Total Downloads

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

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gupta BHan CChaurasia P(2024)Privacy-Preserving Techniques and User Anonymity in the MetaverseMetaverse Security Paradigms10.4018/979-8-3693-3824-7.ch012(304-317)Online publication date: 21-Aug-2024
https://doi.org/10.4018/979-8-3693-3824-7.ch012
Fenner JGaleas PEscobar FNeira R(2024)Secure IoT Communication: Implementing a One-Time Pad Protocol with True Random Numbers and Secure Multiparty SumsApplied Sciences10.3390/app1412535414:12(5354)Online publication date: 20-Jun-2024
https://doi.org/10.3390/app14125354
Yigzaw KMichalas ABellika J(2017)Secure and scalable deduplication of horizontally partitioned health data for privacy-preserving distributed statistical computationBMC Medical Informatics and Decision Making10.1186/s12911-016-0389-x17:1Online publication date: 3-Jan-2017
https://doi.org/10.1186/s12911-016-0389-x
Mathew GObradovic Z(2015)A distributed decision support algorithm that preserves personal privacyJournal of Intelligent Information Systems10.1007/s10844-014-0331-644:1(107-132)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.1007/s10844-014-0331-6
Yigzaw KBellika JAndersen AHartvigsen GFernandez-Llatas CAndersen AXu C(2013)Towards privacy-preserving computing on distributed electronic health record dataProceedings of the 2013 Middleware Doctoral Symposium10.1145/2541534.2541593(1-6)Online publication date: 9-Dec-2013
https://dl.acm.org/doi/10.1145/2541534.2541593
Küpçü A(2013)Distributing trusted third partiesACM SIGACT News10.1145/2491533.249155344:2(92-112)Online publication date: 3-Jun-2013
https://dl.acm.org/doi/10.1145/2491533.2491553
He XVaidya JShafiq BAdam NWhite T(2012)Privacy Preserving Integration of Health Care DataInnovations in Data Methodologies and Computational Algorithms for Medical Applications10.4018/978-1-4666-0282-3.ch007(94-107)Online publication date: 2012
https://doi.org/10.4018/978-1-4666-0282-3.ch007
Kang JYi OKim MChang K(2012)Practical Multi-party Versions of Private Set Intersection Protocols with Hardware TokensComputer Applications for Communication, Networking, and Digital Contents10.1007/978-3-642-35594-3_10(72-79)Online publication date: 2012
https://doi.org/10.1007/978-3-642-35594-3_10
Bohli JLi WSeedorf J(2012)Assisting server for secure multi-party computationProceedings of the 6th IFIP WG 11.2 international conference on Information Security Theory and Practice: security, privacy and trust in computing systems and ambient intelligent ecosystems10.1007/978-3-642-30955-7_13(144-159)Online publication date: 20-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30955-7_13
Shaikh ZGarg P(2012)Single and Multi Trusted Third Party: Comparison, Identification and Reduction of Malicious Conduct by Trusted Third Party in Secure Multiparty Computing ProtocolAdvances in Computer Science, Engineering & Applications10.1007/978-3-642-30111-7_28(295-304)Online publication date: 2012
https://doi.org/10.1007/978-3-642-30111-7_28
Show More Cited By

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.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten