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
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
“the definition in appendix A, and refer the reader to [15] for the details.”
BackgroundMethodSecure 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
Chosen-Ciphertext Security from Identity-Based Encryption
Canetti, R., Halevi, S., & Katz, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_13 · Cited by 900
Self-citationA Survey of Distributed Consensus Protocols for Blockchain Networks
Xiao, Y., Zhang, N., Lou, W., & Hou, Y. T. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2969706 · Cited by 841
Risius, M., & Spohrer, K. (2017) · Business & Information Systems Engineering · doi:10.1007/s12599-017-0506-0 · Cited by 803
Quantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
Universally Composable Notions of Key Exchange and Secure Channels
Canetti, R., & Krawczyk, H. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_22 · Cited by 746
“(In a sense, here Z serves as an “interactive distinguisher” between a run of the protocol and the ideal process with access to F. See [ c01 ] for more motivating discussion on the role of the environment.)”
BackgroundMethodInfluentialSelf-citationHMQV: A High-Performance Secure Diffie-Hellman Protocol: (Extended Abstract)
Krawczyk, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_33 · Cited by 730
Universally composable two-party and multi-party secure computation
Canetti, R., Lindell, Y., Ostrovsky, R., & Sahai, A. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509980 · Cited by 717
Self-citationSharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
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
Entropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
Tight finite-key analysis for quantum cryptography
Tomamichel, M., Lim, C. C. W., Gisin, N., & Renner, R. (2012) · Nature Communications · doi:10.1038/ncomms1631 · Cited by 634
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-citationDeepChain: Auditable and Privacy-Preserving Deep Learning with Blockchain-based Incentive
Weng, J., Weng, J., Zhang, J., Li, M., Zhang, Y., & Luo, W. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2952332 · Cited by 610
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
BiTR: Built-in Tamper Resilience
Choi, S. G., Kiayias, A., & Malkin, T. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_40 · Cited by 590
Town Crier: An Authenticated Data Feed for Smart Contracts
Zhang, F., Cecchetti, E., Croman, K., Juels, A., & Shi, E. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978326 · Cited by 580
On the Security of Joint Signature and Encryption
An, J. H., Dodis, Y., & Rabin, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_6 · Cited by 571
Chosen-ciphertext secure proxy re-encryption
Canetti, R., & Hohenberger, S. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315269 · Cited by 540
Self-citationStep by Step Towards Creating a Safe Smart Contract: Lessons and Insights from a Cryptocurrency Lab
Delmolino, K., Arnett, M., Kosba, A., Miller, A., & Shi, E. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53357-4_6 · Cited by 505
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090263 · Cited by 493
Self-citationFounding 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
Multiparty 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
Random Oracles in a Quantum World
Boneh, D., Dagdelen, Ö., Fischlin, M., Lehmann, A., Schaffner, C., & Zhandry, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_3 · Cited by 449
Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J. B., & Toft, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_15 · Cited by 443
Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts
Cheng, R., Zhang, F., Kos, J., He, W., Hynes, N., Johnson, N., Juels, A., Miller, A., & Song, D. (2019) · 2019 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2019.00023 · Cited by 431
Chosen‐Ciphertext Security from Identity‐Based Encryption
Boneh, D., Canetti, R., Halevi, S., & Katz, J. (2007) · SIAM Journal on Computing · doi:10.1137/s009753970544713x · Cited by 415
Self-citationSecureNN: 3-Party Secure Computation for Neural Network Training
Wagh, S., Gupta, D., & Chandran, N. (2019) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2019-0035 · Cited by 413
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
Keller, M., Orsini, E., & Scholl, P. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978357 · Cited by 411
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
Araki, T., Furukawa, J., Lindell, Y., Nof, A., & Ohara, K. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978331 · Cited by 405
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
Security in quantum cryptography
Portmann, C., & Renner, R. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025008 · Cited by 390
Perfect Non-interactive Zero Knowledge for NP
Groth, J., Ostrovsky, R., & Sahai, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_21 · Cited by 381
How to Simulate It – A Tutorial on the Simulation Proof Technique
Lindell, Y. (2017) · Information Security and Cryptography · doi:10.1007/978-3-319-57048-8_6 · Cited by 381
A New Approach to Practical Active-Secure Two-Party Computation
Nielsen, J. B., Nordholt, P. S., Orlandi, C., & Burra, S. S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_40 · Cited by 379
Secure device-independent quantum key distribution with causally independent measurement devices
Masanes, L., Pironio, S., & Acín, A. (2011) · Nature Communications · doi:10.1038/ncomms1244 · Cited by 376
Lattice Cryptography for the Internet
Peikert, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11659-4_12 · Cited by 356
Semi-homomorphic Encryption and Multiparty Computation
Bendlin, R., Damgård, I., Orlandi, C., & Zakarias, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_11 · Cited by 354
Structure-Preserving Signatures and Commitments to Group Elements
Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., & Ohkubo, M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_12 · Cited by 354
How to Use Bitcoin to Design Fair Protocols
Bentov, I., & Kumaresan, R. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44381-1_24 · Cited by 339
Distributing Secret Keys with Quantum Continuous Variables: Principle, Security and Implementations
Diamanti, E., & Leverrier, A. (2015) · Entropy · doi:10.3390/e17096072 · Cited by 339
Universally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
Universally Composable Security with Global Setup
Canetti, R., Dodis, Y., Pass, R., & Walfish, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_4 · Cited by 331
Self-citationQuantum Information Processing with Finite Resources
Tomamichel, M. (2016) · SpringerBriefs in Mathematical Physics · doi:10.1007/978-3-319-21891-5 · Cited by 329
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
A Pragmatic Introduction to Secure Multi-Party Computation
Evans, D., Kolesnikov, V., & Rosulek, M. (2018) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000019 · Cited by 321
Quantum state discrimination and its applications
Bae, J., & Kwek, L.-C. (2015) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/48/8/083001 · Cited by 320
Lindell, Y. (2021) · Communications of the ACM · doi:10.1145/3387108 · Cited by 320
Privacy-preserving smart metering
Rial, A., & Danezis, G. (2011) · Proceedings of the 10th annual ACM workshop on Privacy in the electronic society · doi:10.1145/2046556.2046564 · Cited by 312
Dynamic Searchable Encryption via Blind Storage
Naveed, M., Prabhakaran, M., & Gunter, C. A. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.47 · Cited by 308
Relaxing Chosen-Ciphertext Security
Canetti, R., Krawczyk, H., & Nielsen, J. B. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_33 · Cited by 304
Self-citationCertified randomness in quantum physics
Acín, A., & Masanes, L. (2016) · Nature · doi:10.1038/nature20119 · Cited by 298
(2010) · Cited by 291
Chatterjee, U., Govindan, V., Sadhukhan, R., Mukhopadhyay, D., Chakraborty, R. S., Mahata, D., & Prabhu, M. M. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2018.2832201 · Cited by 290
Universally Composable Password-Based Key Exchange
Canetti, R., Halevi, S., Katz, J., Lindell, Y., & MacKenzie, P. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_24 · Cited by 285
Self-citationConcurrency and Privacy with Payment-Channel Networks
Malavolta, G., Moreno-Sanchez, P., Kate, A., Maffei, M., & Ravi, S. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134096 · Cited by 284
Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption
Boneh, D., & Katz, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_8 · Cited by 283
Overdrive: Making SPDZ Great Again
Keller, M., Pastro, V., & Rotaru, D. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78372-7_6 · Cited by 275
Scalable and Unconditionally Secure Multiparty Computation
Damgård, I., & Nielsen, J. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_32 · Cited by 270
Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability
Malavolta, G., Moreno-Sanchez, P., Schneidewind, C., Kate, A., & Maffei, M. (2019) · Proceedings 2019 Network and Distributed System Security Symposium · doi:10.14722/ndss.2019.23330 · Cited by 270
Security of quantum key distribution
Renner, R. (2005) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-005115027 · Cited by 263
Yang, Q., Liu, Y., Cheng, Y., Kang, Y., Chen, T., & Yu, H. (2019) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00960ed2v01y201910aim043 · Cited by 261
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-citationCrypTen: Secure Multi-Party Computation Meets Machine Learning
Knott, B., Venkataraman, S., Hannun, A., Sengupta, S., Ibrahim, M., & van der Maaten, L. (2021) · arXiv · doi:10.48550/arxiv.2109.00984 · Cited by 257
“The proof of this lemma follows trivially from [9, 11, 21, 24], and is given in the appendix.”
BackgroundUC-Secure Searchable Symmetric Encryption
Kurosawa, K., & Ohtaki, Y. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_21 · Cited by 255
Chase, M., & Lysyanskaya, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_5 · Cited by 253
Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction
Ma, X., Xu, F., Xu, H., Tan, X., Qi, B., & Lo, H.-K. (2013) · Physical Review A · doi:10.1103/physreva.87.062327 · Cited by 241
The Universal Composable Security of Quantum Key Distribution
Ben-Or, M., Horodecki, M., Leung, D. W., Mayers, D., & Oppenheim, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_21 · Cited by 227
Full randomness from arbitrarily deterministic events
Gallego, R., Masanes, L., De La Torre, G., Dhara, C., Aolita, L., & Acín, A. (2013) · Nature Communications · doi:10.1038/ncomms3654 · Cited by 186
SoK: Computer-Aided Cryptography
Barbosa, M., Barthe, G., Bhargavan, K., Blanchet, B., Cremers, C., Liao, K., & Parno, B. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00008 · Cited by 143
GNUC: A new universal composability framework
Hofheinz, D., & Shoup, V. (2015) · Journal of Cryptology · doi:10.1007/s00145-013-9160-y · Cited by 80
“By modularity, we mean that protocol components (i.e., subprotocols) can be analyzed separately; once all components are shown secure, the whole protocol should be.”
BackgroundPESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server
Baum, C., Frederiksen, T., Hesse, J., Lehmann, A., & Yanai, A. (2020) · 2020 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp48549.2020.00044 · Cited by 49
“We follow the previous line of work [28], [29], [31] and model security for our dpOPRF via an ideal functionality F dpOPRF in the UC framework [12].”
MethodDecentralized Privacy-Preserving Fair Exchange Scheme for V2G Based on Blockchain
Wan, Z., Zhang, T., Liu, W., Wang, M., & Zhu, L. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3059345 · Cited by 44
Formalizing Data Deletion in the Context of the Right to Be Forgotten
Garg, S., Goldwasser, S., & Vasudevan, P. N. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-45724-2_13 · Cited by 8
MAC-in-the-Box: Verifying a Minimalistic Hardware Design for MAC Computation
Küennemann, R., & Nemati, H. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-59013-0_26
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.