Calculus of Cryptographic Communication
Calculus of Cryptographic Communication
复制标题
密码通信演算
DOI:
--
复制
发表时间:
2006
期刊:
影响因子:
--
通讯作者:
U. Nestmann
中科院分区:
文献类型:
--
作者:
J. Borgström;S. Kramer;U. Nestmann
We define C3, a model-based formalism that is one half of a framework for the modelling, specification and verification of cryptographic protocols. C3 consists of a design language of distributed processes and an associated (SOS) notion of concurrent execution. The other half of our framework is a property-based formalism, i.e., a logic for the specification and verification of cryptographic protocols, called CPL. The two primary features of the co-design of C3 and CPL are that reduction constraints of C3-processes are checkable via CPL-satisfaction, and that C3’s notion of observational equivalence and CPL’s notion of propositional knowledge have a common definitional basis, namely structurally indistinguishable protocol histories. Moreover, this co-design permits separation of the concerns of protocol and property description, within the same framework. Other important features of C3 are explicit notions of secure (out- of-band) communication and history-based key lookup, which together give a concrete foundation on which to base authentication and key establishment protocols.