Bayesian rational exchange

被引:6
作者
Estevez-Tapiador, Juan M. [1 ]
Alcaide, Almudena [1 ]
Hernandez-Castro, Julio C. [1 ]
Ribagorda, Arturo [1 ]
机构
[1] Univ Carlos III Madrid, Dept Comp Sci, Madrid 28911, Spain
关键词
rational exchange; Syverson's protocol; cryptographic protocols; automated validation; Game Theory;
D O I
10.1007/s10207-007-0039-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The notion of rational exchange introduced by Syverson (Proceedings of the 11th IEEE Computer Society Foundations Workshop, pp. 2-13, 1998) is a particularly interesting alternative when an efficient scheme for fair exchange is required but the use of a trusted third party is not allowed. A rational exchange protocol cannot provide fairness, but it ensures that rational (i.e., self-interested) parties would have no reason to deviate from the protocol. Buttyan et al. (J. Comput. Security 12(3/4), 551-588, 2004) have recently pointed out how rationality in exchange protocols can be formalized and studied within the framework provided by Game Theory. In particular, Buttyan's formal model was used to analyze Syverson's rational exchange protocol. In this paper, we identify a series of drawbacks in Buttyan's model which make it somewhat restrictive and unrealistic. We propose an extension to the model which enables us to consider different classes of protocol parties (e.g., honest and dishonest parties), as well as modeling attributes such as reputation or any other participant beliefs that could have an effect on the protocol outcome. The resulting new model enables us to reason rational exchange protocols from the point of view of Bayesian rationality, a notion that may be in some scenarios more appropriate than that defined in terms of Nash equilibrium.
引用
收藏
页码:85 / 100
页数:16
相关论文
共 17 条
[1]  
Abadi M., 2002, P 11 INT C WORLD WID, P387
[2]   Asynchronous protocols for optimistic fair exchange [J].
Asokan, N ;
Shoup, V ;
Waidner, M .
1998 IEEE SYMPOSIUM ON SECURITY AND PRIVACY - PROCEEDINGS, 1998, :86-99
[3]  
Asokan N., 1998, PhD thesis
[4]  
ASOKAN N, 1997, 4 ACM C COMP COMM SE, V6, P8
[5]  
Bahreman A., 1994, Proceedings Internet Society Symposium on Network and Distributed System Security 1994, P3
[6]  
Buttyan L., 2004, Journal of Computer Security, V12, P551
[7]  
Buttyán L, 2002, P IEEE CSFW, P193
[8]  
BUTTYAN L, 2001, P 2 INT WORKSH EL CO
[9]  
Even S., 1980, 175 COMP SCI DEP
[10]   IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS [J].
FISCHER, MJ ;
LYNCH, NA ;
PATERSON, MS .
JOURNAL OF THE ACM, 1985, 32 (02) :374-382