An Event Graph for Concurrent Computing in Cryptographic Protocols

摘要：

In this paper we introduce the event graph for concurrent computing in cryptographic protocols that, is composed of meta-graphs and adopted as the formalism of cryptographic protocols that run in an infinite concurrent way, and new operations such as prefixing, parallel composition of event graphs to be defined in terms of traditional process operations. The event graph is used as a novel and effective model for proving safety properties of cryptographic protocols running in an infinite concurrent way. Proofs of safety properties using theorem proving are dependent on bi-simulation equivalence relations of the event graphs. This paper presents bi-simulation equivalence relations of the event graphs. The event graph model that meets the UC security can be also extended to describe other concurrent systems.

关键词： event graph concurrent computing meta-graph UC security cryptographic protocol

作者: Huanbao Wang Yilan Chen

作者单位: Department of Maths & Physics Anhui University of Architecture Hefei 230601, China

会议类型: 国际会议

会议名称: 2010 Second Asia-Pacific Conference on Information Processing(2010年第二届亚太地区信息处理国际会议 APCIP 2010)

会议地点: 南昌

会议语种:英文

页码: 575-578

在线出版日期: 2010-09-17（万方平台首次上网日期，不代表论文的发表时间）