The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Universally composable two-party and multi-party secure computation
Abstract
We show how to securely realize any multi-party functionality in a universally composable way, regardless of the number of corrupted participants. That is, we consider a multi-party network with open communication and an adversary that can adaptively corrupt as many parties as it wishes. In this setting, our protocols allow any subset of the parties (with pairs of parties being a special case) to securely realize any desired functionality of their local inputs, and be guaranteed that security is preserved regardless of the activity in the rest of the network. This implies that security is preserved under concurrent composition of an unbounded number of protocol executions, it implies non-malleability with respect to arbitrary protocols, and more. Our constructions are in the common reference string model and make general intractability assumptions.
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
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
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
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Self-citationThe knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
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
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Self-citationGoldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
A hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
Verifiable secret sharing and multiparty protocols with honest majority
Rabin, T., & Ben-Or, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73014 · Cited by 930
Non-interactive zero-knowledge and its applications
Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
Universally Composable Commitments
Canetti, R., & Fischlin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_2 · Cited by 621
Self-citationNon-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Sahai, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814628 · Cited by 575
Self-citationAdaptively secure multi-party computation
Canetti, R., Feige, U., Goldreich, O., & Naor, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.238015 · Cited by 548
Self-citationPublic-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
Bellare, M., Boldyreva, A., & Micali, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_18 · Cited by 519
Blum, M., De Santis, A., Micali, S., & Persiano, G. (1991) · SIAM Journal on Computing · doi:10.1137/0220068 · Cited by 427
Dwork, C., Naor, M., & Sahai, A. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276853 · Cited by 425
Self-citationFair Computation of General Functions in Presence of Immoral Majority
Goldwasser, S., & Levin, L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_6 · Cited by 353
Robust Non-interactive Zero Knowledge
De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., & Sahai, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_33 · Cited by 293
Self-citationZero Knowledge Proofs of Knowledge in Two Rounds
Feige, U., & Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_46 · Cited by 280
Composition and integrity preservation of secure reactive systems
Pfitzmann, B., & Waidner, M. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352639 · Cited by 277
Universal Composition with Joint State
Canetti, R., & Rabin, T. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_16 · Cited by 259
Self-citationBlum, M. (1981) · International Cryptology Conference · Cited by 256
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
Beaver, D. (1991) · Journal of Cryptology · doi:10.1007/bf00196771 · Cited by 228
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Damgård, I., & Nielsen, J. B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_27 · Cited by 177
Zero-knowledge proofs of knowledge without interaction
De Santis, A., & Persiano, G. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267809 · Cited by 161
Non-interactive and non-malleable commitment
Crescenzo, G. D., Ishai, Y., & Ostrovsky, R. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276722 · Cited by 159
Self-citationGeneral Composition and Universal Composability in Secure Multiparty Computation
Lindell, Y. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9021-2 · Cited by 142
Self-citationDamgård, I., & Nielsen, J. B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_37 · Cited by 135
Efficient and Non-interactive Non-malleable Commitment
Crescenzo, G. D., Katz, J. I., Ostrovsky, R., & Smith, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_4 · Cited by 121
Self-citationSecure Computation without Agreement: Extended Abstract
Goldwasser, S., & Lindell, Y. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36108-1_2 · Cited by 105
Self-citationCryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
Galil, Z., Haber, S., & Yung, M. M. (1987) · International Cryptology Conference · Cited by 89
Uses of randomness in algorithms and protocols
Kilian, J. (1991) · Choice Reviews Online · doi:10.5860/choice.28-6294 · Cited by 86
On the composition of authenticated byzantine agreement
Lindell, Y., Lysyanskaya, A., & Rabin, T. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.509982 · Cited by 56
Self-citationReducibility and completeness in multi-party private computations
Kushilevitz, E., Micali, S. M., & Ostrovsky, R. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365743 · Cited by 50
Self-citationGaray, J. A., & MACKENZIE, P. D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892120 · Cited by 42
Cited by
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331
A Framework for Efficient and Composable Oblivious Transfer
Peikert, C., Vaikuntanathan, V., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_31 · Cited by 678
Founding Cryptography on Oblivious Transfer – Efficiently
Ishai, Y., Prabhakaran, M., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_32 · Cited by 460
Self-citationMultiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Asharov, G., Jain, A., López-Alt, A., Tromer, E., Vaikuntanathan, V., & Wichs, D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_29 · Cited by 454
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Groth, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11935230_29 · Cited by 390
Metadata
- Authors
- Canetti, R., Lindell, Y., Ostrovsky, R., & Sahai, A.
- Venue
- Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2002-05-19
- Pages
- 494-503
- OpenAlex
- W2113085788
- Cited by
- 717
- References
- 41
- FWCI
- 19.84
- 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.