The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Secure multi-party computation problems and their applications: a review and open problems
Abstract
The growth of the Internet has triggered tremendous opportunities for cooperative computation, where people are jointly conducting computation tasks based on the private inputs they each supplies. These computations could occur between mutually untrusted parties, or even between competitors. For example, customers might send to a remote database queries that contain private information; two competing financial organizations might jointly invest in a project that must satisfy both organizations' private and valuable constraints, and so on. Today, to conduct such computations, one entity must usually know the inputs from all the participants; however if nobody can be trusted enough to know all the inputs, privacy will become a primary concern.This problem is referred to as Secure Multi-party Computation Problem (SMC) in the literature. Research in the SMC area has been focusing on only a limited set of specific SMC problems, while privacy concerned cooperative computations call for SMC studies in a variety of computation domains. Before we can study the problems, we need to identify and define the specific SMC problems for those computation domains. We have developed a framework to facilitate this problem-discovery task. Based on our framework, we have identified and defined a number of new SMC problems for a spectrum of computation domains. Those problems include privacy-preserving database query, privacy-preserving scientific computations, privacy-preserving intrusion detection, privacy-preserving statistical analysis, privacy-preserving geometric computations, and privacy-preserving data mining.The goal of this paper is not only to present our results, but also to serve as a guideline so other people can identify useful SMC problems in their own computation domains.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“These approaches are based on many cryptographic tools including zero-knowledge proof [35], oblivious transfer [34], 1-out-ofn oblivious transfer [17, 9] oblivious evaluation of polynomials [32], secret sharing [36], threshold cryptography [15, 11], Yao’s Millionaire Protocol [39, 7].”
BackgroundFundamentals of digital image processing
Jain, A. K. (1988) · Cited by 7,111
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Applied cryptography: Protocols, algorithms, and source code in C
(1994) · Computer Law & Security Report · doi:10.1016/0267-3649(94)90017-5 · Cited by 3,411
Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
Warner, S. L. (1965) · Journal of the American Statistical Association · doi:10.1080/01621459.1965.10480775 · Cited by 3,255
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492461 · Cited by 1,116
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Replication is not needed: single database, computationally-private information retrieval
Kushilevitz, E., & Ostrovsky, R. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646125 · Cited by 932
Oblivious transfer and polynomial evaluation
Naor, M., & Pinkas, B. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301312 · Cited by 629
(1995) · Choice Reviews Online · doi:10.5860/choice.32-5696 · Cited by 582
Computationally Private Information Retrieval with Polylogarithmic Communication
Cachin, C., Micali, S., & Stadler, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_28 · Cited by 579
Protecting data privacy in private information retrieval schemes
Gertner, Y., Ishai, Y., Kushilevitz, E., & Malkin, T. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276723 · Cited by 445
Sutcliffe, P. (2000) · The History of the University of Oxford · doi:10.1093/acprof:oso/9780199510177.003.0026 · Cited by 379
All-or-Nothing Disclosure of Secrets
Brassard, G., Crepeau, C., & Robert, J.-M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_17 · Cited by 297
(1998) · Choice Reviews Online · doi:10.5860/choice.36-1021 · Cited by 280
Privacy-preserving cooperative statistical analysis
Du, W., & Atallah, M. J. (2005) · Seventeenth Annual Computer Security Applications Conference · doi:10.1109/acsac.2001.991526 · Cited by 279
Self-citationEfficient private bidding and auctions with an oblivious third party
Cachin, C. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319726 · Cited by 267
Computationally private information retrieval (extended abstract)
Chor, B., & Gilboa, N. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258609 · Cited by 249
Multi party computations: past and present
Goldwasser, S. (1997) · Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 · doi:10.1145/259380.259405 · Cited by 237
Secure Multi-party Computational Geometry
Atallah, M. J., & Du, W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44634-6_16 · Cited by 234
Self-citationAdvances in Distributed and Parallel Knowledge Discovery
Kargupta, H., & Chan, P. K. (2000) · The MIT Press eBooks · Cited by 231
The Linear Randomized Response Model
Warner, S. L. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482364 · Cited by 190
Privacy-preserving cooperative scientific computations
Du, W., & Atallah, M. J. (2005) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930152 · Cited by 166
Self-citationSome recent research aspects of threshold cryptography
Desmedt, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0030418 · Cited by 158
A Comparison of Three Randomized Response Models for Quantitative Data
Pollock, K. H., & Bek, Y. (1976) · Journal of the American Statistical Association · doi:10.1080/01621459.1976.10480963 · Cited by 148
Protocols for Secure Remote Database Access with Approximate Matching
Du, W. K., & Atallah, M. J. (2001) · Advances in information security · doi:10.1007/978-1-4615-1467-1_6 · Cited by 140
Self-citationThe Randomized Response Technique: A Test on Drug Use
Goodstadt, M. S., & Gruson, V. (1975) · Journal of the American Statistical Association · doi:10.1080/01621459.1975.10480307 · Cited by 103
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
Ishai, Y., & Eyal Kushilevitz, Z. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301275 · Cited by 73
A Random Server Model for Private Information Retrieval
Gertner, Y., Goldwasser, S., & Malkin, T. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49543-6_17 · Cited by 55
Gertner, Y., Goldwasser, S., & Malkin, T. (1998) · Cited by 47
Universal service-providers for database private information retrieval (extended abstract)
Crescenzo, G. D., Ishai, Y., & Ostrovsky, R. (1998) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/277697.277713 · Cited by 37
(1997)
Cited by
An overview on smart contracts: Challenges, advances and platforms
Zheng, Z., Xie, S., Dai, H.-N., Chen, W., Chen, X., Weng, J., & Imran, M. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2019.12.019 · Cited by 1,197
Privacy preserving association rule mining in vertically partitioned data
Vaidya, J., & Clifton, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775142 · Cited by 1,001
The new Casper: query processing for location services without compromising privacy
Mokbel, M. F., Chow, C.-Y., & Aref, W. G. (2006) · doi:10.5555/1182635.1164193 · Cited by 999
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
Privacy-preserving k -means clustering over vertically partitioned data
Vaidya, J., & Clifton, C. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956776 · Cited by 626
Metadata
- Authors
- Du, W., & Atallah, M. J.
- Venue
- Proceedings of the 2001 workshop on New security paradigms
- Publisher
- ACM
- Published
- 2001-09-10
- Pages
- 13-22
- OpenAlex
- W2016267457
- Cited by
- 453
- References
- 38
- FWCI
- 3.35
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.