Game-Based Automated Security Proofs for Cryptographic Protocols

摘要：

Provable security has become a popular approach for analyzing the security of cryptograph-ic protocols. However, writing and verifying proofs by hand are prone to errors. This paper advocates the automatic security proof framework with se-quences of games. We make slight modifications to Blanchets calculus to make it easy for parsing the initial game. The main contribution of this work is that it introduces algebraic properties with observa-tional equivalences to automatic security proofs, and thus can deal with some practical cryptographic schemes with hard problems. We illustrate the use of algebraic properties in the framework by proving the semantic security of the ElGamal encryption scheme.

关键词： cryptographic protocols probable secu-rity automatic security proof process calculus

作者: Gu Chunxiang Guang Yan Zhu Yuefei

作者单位: Information Engineering College,Information Engineering University, Zhengzhou 450002, Henan Province, P. R. China

会议类型: 国际会议

会议名称: 2011年中国计算机学会服务计算学术会议(CCF NCSC2011)

会议地点: 济南

会议语种:英文

页码: 50-57

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