Universally Composable Security

被引:43
|
作者
Canetti, Ran [1 ]
机构
[1] Boston Univ, Dept Comp Sci, 111 Cummington Mall, Boston, MA 02215 USA
基金
美国国家科学基金会;
关键词
Security modeling; specification; and analysis; security-preserving composition; universal composition; modular security; ZERO-KNOWLEDGE; CRYPTOGRAPHIC PROTOCOLS; GENERAL COMPOSITION; COMPLEXITY; NOTIONS; SYSTEMS; PROOFS;
D O I
10.1145/3402457
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This work presents a general framework for describing cryptographic protocols and analyzing their security. The framework allows specifying the security requirements of practically any cryptographic task in a unified and systematic way. Furthermore, in this framework the security of protocols is preserved under a general composition operation, called universal composition. The proposed framework with its security-preserving composition operation allows for modular design and analysis of complex cryptographic protocols from simpler building blocks. Moreover, within this framework, protocols are guaranteed to maintain their security in any context, even in the presence of an unbounded number of arbitrary protocol sessions that run concurrently in an adversarially controlled manner. This is a useful guarantee, which allows arguing about the security of cryptographic protocols in complex and unpredictable environments such as modern communication networks.
引用
收藏
页数:94
相关论文
共 50 条
  • [1] On the Universally Composable Security of OpenStack
    Hogan, Kyle
    Maleki, Hoda
    Rahaeimehr, Reza
    Canetti, Ran
    van Dijk, Marten
    Hennessey, Jason
    Varia, Mayank
    Zhang, Haibin
    [J]. 2019 IEEE SECURE DEVELOPMENT (SECDEV 2019), 2019, : 20 - 33
  • [2] Universally Composable Symbolic Security Analysis
    Canetti, Ran
    Herzog, Jonathan
    [J]. JOURNAL OF CRYPTOLOGY, 2011, 24 (01) : 83 - 147
  • [3] Universally composable security with global setup
    Canetti, Ran
    Dodis, Yevgeniy
    Pass, Rafael
    Walfish, Shabsi
    [J]. THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2007, 4392 : 61 - 85
  • [4] Universally Composable Symbolic Security Analysis
    Ran Canetti
    Jonathan Herzog
    [J]. Journal of Cryptology, 2011, 24 : 83 - 147
  • [5] Universally Composable Security Analysis of TLS
    Gajek, Sebastian
    Manulis, Mark
    Pereira, Olivier
    Sadeghi, Ahmad-Reza
    Schwenk, Joerg
    [J]. PROVABLE SECURITY, 2008, 5324 : 313 - +
  • [6] Universally composable security: A new paradigm for cryptographic protocols
    Canetti, R
    [J]. 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 136 - 145
  • [7] EKE Meets Tight Security in the Universally Composable Framework
    Liu, Xiangyu
    Liu, Shengli
    Han, Shuai
    Gu, Dawu
    [J]. PUBLIC-KEY CRYPTOGRAPHY - PKC 2023, PT I, 2023, 13940 : 685 - 713
  • [8] RFID Mutual Authentication Protocols with Universally Composable Security
    Su, Chunhua
    Li, Yingjiu
    Deng, Robert H.
    [J]. RADIO FREQUENCY IDENTIFICATION SYSTEM SECURITY (RFIDSEC'11), 2011, 6 : 35 - 49
  • [9] Obtaining Universally Composable security: Towards the bare bones of trust
    Canetti, Ran
    [J]. ADVANCES IN CRYPTOLOGY - ASIACRYPT 2007, 2007, 4833 : 88 - 112
  • [10] EasyUC: Using EASYCRYPT to Mechanize Proofs of Universally Composable Security
    Canetti, Ran
    Stoughton, Alley
    Varia, Mayank
    [J]. 2019 IEEE 32ND COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2019), 2019, : 167 - 183