The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
Universally composable security: a new paradigm for cryptographic protocols
Abstract
We propose a novel paradigm for defining security of cryptographic protocols, called universally composable security. The salient property of universally composable definitions of security is that they guarantee security even when a secure protocol is composed of an arbitrary set of protocols, or more generally when the protocol is used as a component of an arbitrary system. This is an essential property for maintaining security of cryptographic protocols in complex and unpredictable environments such as the Internet. In particular, universally composable definitions guarantee security even when an unbounded number of protocol instances are executed concurrently in an adversarially controlled manner, they guarantee non-malleability with respect to arbitrary protocols, and more. We show how to formulate universally composable definitions of security for practically any cryptographic task. Furthermore, we demonstrate that practically any such definition can be realized using known techniques, as long as only a minority of the participants are corrupted. We then proceed to formulate universally composable definitions of a wide array of cryptographic tasks, including authenticated and secure communication, key-exchange, public-key encryption, signature, commitment, oblivious transfer, zero knowledge and more. We also make initial steps towards studying the realizability of the proposed definitions in various settings.
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
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Milner, R. (1989) · Cited by 6,877
On the security of public key protocols
Dolev, D., & Yao, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,833
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
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
The 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
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Introduction to the Theory of Computation
Sipser, M. (1996) · ACM SIGACT News · doi:10.1145/230514.571645 · Cited by 2,784
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
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
Communicating and Mobile Systems: the Pi-Calculus
Milner, R. (1999) · Cited by 2,256
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61769-8 · Cited by 1,865
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Differential fault analysis of secret key cryptosystems
Biham, E., & Adi Shamir, Z. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052259 · Cited by 1,671
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Canetti, R., & Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_28 · Cited by 1,653
Self-citationA 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-citationA calculus for cryptographic protocols: the spi calculus
Abadi, M., & Gordon, A. D. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266432 · Cited by 1,154
Towards Sound Approaches to Counteract Power-Analysis Attacks
Chari, S. T., Jutla, C. S., Rao, J. R., & Rohatgi, P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1_26 · Cited by 1,126
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
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
How to Exchange Secrets with Oblivious TransferPreprint
Rabin, M. O. (1981) · IACR Cryptology ePrint Archive · Cited by 870
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
Burrows, M., Abadi, M., & Needham, R. (1989) · Proceedings of the twelfth ACM symposium on Operating systems principles · doi:10.1145/74850.74852 · Cited by 641
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-citationDefinitions and properties of zero-knowledge proof systems
Goldreich, O., & Oren, Y. (1994) · Journal of Cryptology · doi:10.1007/bf00195207 · Cited by 614
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*
Abadi, M., & Rogaway, P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0014-7 · Cited by 613
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Gennaro, R., Rabin, M. O., & Rabin, T. (1998) · Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 · doi:10.1145/277697.277716 · Cited by 464
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
On the Composition of Zero-Knowledge Proof Systems
Goldreich, O., & Krawczyk, H. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539791220688 · Cited by 423
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Cited by 381
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
A model for asynchronous reactive systems and its application to secure message transmission
Pfitzmann, B., & Waidner, M. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924298 · Cited by 349
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
Nielsen, J. B. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_8 · Cited by 324
On Formal Models for Secure Key Exchange.
Shoup, V. (1999) · Cited by 322
Lindell, Y. (2021) · Communications of the ACM · doi:10.1145/3387108 · Cited by 320
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
Blum, M. (1981) · International Cryptology Conference · Cited by 256
Three systems for cryptographic protocol analysis
Kemmerer, R., Meadows, C., & Millen, J. (1994) · Journal of Cryptology · doi:10.1007/bf00197942 · Cited by 234
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
Hirt, M., & Maurer, U. (2000) · Journal of Cryptology · doi:10.1007/s001459910003 · Cited by 233
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
Asynchronous secure computation
Ben-Or, M., Canetti, R., & Goldreich, O. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167109 · Cited by 227
Self-citationEfficient Multiparty Computations Secure Against an Adaptive Adversary
Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_22 · Cited by 220
A probabilistic poly-time framework for protocol analysis
Lincoln, P., Mitchell, J., Mitchell, M., & Scedrov, A. (1998) · Proceedings of the 5th ACM conference on Computer and communications security · doi:10.1145/288090.288117 · Cited by 209
Formal verification of cryptographic protocols: A survey
Meadows, C. A., & Meadows, C. A. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0000430 · Cited by 177
Multiset rewriting and the complexity of bounded security protocols
Durgin, N., Lincoln, P., Mitchell, J., & Scedrov, A. (2004) · Journal of Computer Security · doi:10.3233/jcs-2004-12203 · Cited by 168
Hirt, M., & Maurer, U. (1997) · Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 · doi:10.1145/259380.259412 · Cited by 164
Micali, S. M., & Rogaway, P. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_32 · Cited by 162
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
Cryptographic Protocols Provably Secure Against Dynamic Adversaries
Beaver, D., & Haber, S. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_26 · Cited by 132
Efficient Non-malleable Commitment Schemes
Fischlin, M., & Fischlin, R. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_26 · Cited by 83
Security and Composition of Multi-party Cryptographic Protocols.
Canetti, R. (1998) · Cited by 81
Self-citationProbabilistic Polynomial-Time Equivalence and Security Analysis
Lincoln, P. D., Mitchell, J. C., Mitchell, M., & Scedrov, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48119-2_43 · Cited by 75
A linguistic characterization of bounded oracle computation and probabilistic polynomial time
Mitchell, J. C., Mitchell, M., & Scedrov, A. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743523 · Cited by 72
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
Pfitzmann, B., Schunter, M., & Waidner, M. (2000) · Cited by 43
Maintaining Authenticated Communication in the Presence of Break-Ins
Canetti, R., Halevi, S., & Herzberg, A. (2000) · Journal of Cryptology · doi:10.1007/s001459910004 · Cited by 42
Self-citationGaray, J. A., & MACKENZIE, P. D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892120 · Cited by 42
Verifiable Secret Sharing as Secure Computation
Gennaro, R., & Micali, S. M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_14 · Cited by 33
A General Framework for Formal Notions of "Secure" Systems
Pfitzmann, B., & Waidner, M. (1994) · Cited by 15
Provably Secure Certified Mail
Pfitzmann, B., Schunter, M., & Waidner, M. (2000) · Cited by 14
Cited by
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
SecureML: A System for Scalable Privacy-Preserving Machine Learning
Mohassel, P., & Zhang, Y. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.12 · Cited by 1,936
Secure quantum key distribution with realistic devices
Xu, F., Ma, X., Zhang, Q., Lo, H.-K., & Pan, J.-W. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.025002 · Cited by 1,543
Efficient Private Matching and Set Intersection
Freedman, M. J., Nissim, K., & Pinkas, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_1 · Cited by 1,266
Metadata
- Authors
- Canetti, R.
- Venue
- Proceedings 42nd IEEE Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 2001
- Pages
- 136-145
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W1499934958
- Cited by
- 3,309
- References
- 70
- FWCI
- 31.50
- 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.