ISSN 1000-1239 CN 11-1777/TP


• 信息安全 • 上一篇    下一篇


田有亮1,2 彭长根1 马建峰2 姜 奇2 朱建明3   

  1. 1(贵州大学理学院 贵阳 550025) 2(西安电子科技大学计算机学院 西安 710071) 3(中央财经大学信息学院 北京 100081) (
  • 出版日期: 2014-02-15

Game-Theoretic Mechanism for Cryptographic Protocol

Tian Youliang1,2, Peng Chenggen1, Ma Jianfeng2, Jiang Qi2, and Zhu Jianming3   

  1. 1(College of Science, Guizhou University, Guiyang 550025) 2(School of Computer Science and Technology, Xidian University, Xi’an 710071) 3(School of Information, Central University of Finance and Economics, Beijing 100081)
  • Online: 2014-02-15

摘要: 在博弈论框架下,基于纳什均衡设计安全协议的计算和通信规则.首先,提出安全协议的扩展式博弈模型,结合通用可组合安全的思想给出安全通信协议博弈参与者集合、信息集、可行策略、行动序列、参与者函数、效用函数等定义;在该模型下的安全协议能安全并发执行.其次,根据博弈的纳什均衡给出安全通信协议的形式化定义.最后,基于该机制给出一个安全协议实例,并分析该安全协议博弈机制的有效性.

关键词: 博弈论, 纳什均衡, 博弈树, 理性安全协议, 通用可组合安全

Abstract: Both game theory and secure communication protocols focus on the designing and analyzing mechanisms for parties in a collaborative manner. Yet the two fields developed very different sets of goals and formalisms. This paper studies the secure communication protocol problem in the game-theoretic setting. The goal of this paper is to formulate computation and communication rules of a secure communication protocol based on Nash equilibrium in the game-theoretic framework. We firstly propose a game-theoretic model of secure protocols, including the player set, information set, available action, action sequence, player function, and utility function using the idea from universally composable security. Since our mode combines with the universally composable ideal, secure protocols can be concurrently run within this model. Secondly, the formalized definition of secure protocols is given according to concept of Nash equilibrium. Thirdly, we give an instance of secure protocol under the game-theoretic mechanism. Finally, the analysis shows that our mechanism is effective.

Key words: game theory, Nash equilibrium, game tree, rational secure protocol, universally composable security