The IITM Model: A Simple and Expressive Model for Universal Composability

The IITM Model: A Simple and Expressive Model for Universal Composability
复制标题

IITM 模型:一个简单而富有表现力的通用可组合性模型

DOI:
10.1007/s00145-020-09352-1
复制
发表时间:
2020
影响因子:
3
通讯作者:
Daniel
Daniel
中科院分区:
计算机科学4区
文献类型:
--
作者:
Küsters;Tuengerthal;Rausch;Daniel

文献摘要

参考文献

被引文献

相似文献

通用可组合性范式允许密码协议的模块化设计和分析。它已广泛且成功地应用于密码学领域。然而,正如这些模型的历史所表明的那样,为通用的可组合性设计一个连贯而简单且富有表现力的模型是非常重要的。例如,在文献中已经指出了UC模型的几个部分严重的问题。在这项工作中,我们提出了一个通用的可组合性的连贯模型,称为IITM模型(“取之不尽的交互式图灵机”)。该模型的一个主要特征是,它是在没有先验固定不相关的细节的情况下陈述的,例如通过会话和参与方标识符寻址机器的特定方式,损坏的特定建模,或特定的协议层次结构。此外,我们采用了非常通用的运行时概念。所有合理的协议和理想的功能都应该基于这个概念以直接和自然的方式表达,并且没有调整,例如(人工)填充消息或(人工)添加额外的消息。尤其是因为这些特征,该模型简单而富有表现力。此外,一般的结果,我们证明,如组成定理,独立于这些细节是如何固定的具体应用。受到其他通用可组合性模型的启发,特别是UC模型,并且由于IITM模型的灵活性和表达性,在概念上,这些模型中制定的结果直接延续到IITM模型。
The universal composability paradigm allows for the modular design and analysis of cryptographic protocols. It has been widely and successfully used in cryptography. However, devising a coherent yet simple and expressive model for universal composability is, as the history of such models shows, highly non-trivial. For example, several partly severe problems have been pointed out in the literature for the UC model. In this work, we propose a coherent model for universal composability, called the IITM model (“Inexhaustible Interactive Turing Machine”). A main feature of the model is that it is stated without a priori fixing irrelevant details, such as a specific way of addressing of machines by session and party identifiers, a specific modeling of corruption, or a specific protocol hierarchy. In addition, we employ a very general notion of runtime. All reasonable protocols and ideal functionalities should be expressible based on this notion in a direct and natural way, and without tweaks, such as (artificial) padding of messages or (artificially) adding extra messages. Not least because of these features, the model is simple and expressive. Also the general results that we prove, such as composition theorems, hold independently of how such details are fixed for concrete applications. Being inspired by other models for universal composability, in particular the UC model and because of the flexibility and expressivity of the IITM model, conceptually, results formulated in these models directly carry over to the IITM model.
多项式运行时和可组合性
DOI: --
发表时间: 2013
影响因子: 3
作者:
D. Hofheinz;Dominique Unruh;J. Müller
通讯作者: J. Müller
DOI: --
发表时间: 2004
期刊: IACR Cryptology ePrint Archive
影响因子: --
作者:
B. Barak;Yehuda Lindell;T. Rabin
通讯作者: T. Rabin
DOI: --
发表时间: 2009
期刊: IEEE Computer Security Foundations Symposium
影响因子: --
作者:
Ralf Küsters;Max Tuengerthal
通讯作者: Max Tuengerthal
DOI: --
发表时间: 2005
影响因子: 3
作者:
Ralf Küsters;Anupam Datta;John C. Mitchell;A. Ramanathan
通讯作者: A. Ramanathan
DOI: 10.1145/1165555.1165570
发表时间: 2006-09
期刊: --
影响因子: --
作者:
R. Canetti
通讯作者: R. Canetti