A new method of formalizing anonymity based on protocol composition logic

被引:5
作者
Feng, Tao [1 ]
Han, Shining [1 ]
Guo, Xian [1 ]
Ma, Donglin [1 ]
机构
[1] Lanzhou Univ Technol, Sch Comp & Commun, Lanzhou 730050, Gansu, Peoples R China
关键词
PCL; anonymity; equivalent messages; equivalent traces; DAA;
D O I
10.1002/sec.1068
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In order to make protocol composition logic (PCL) model satisfy the special needs of anonymous analysis, based on observational equivalence theory, this paper extended PCL to be anonymity PCL (APCL). In anonymity PCL, equivalent messages and equivalent traces were proposed. On the basis of equivalent traces, three kinds of anonymity were defined: sender anonymity, recipient anonymity, and relation anonymity. Finally, taking direct anonymous attestation (DAA) as an example, we formalized the anonymity of DAA by the new framework, the result of which demonstrates that DAA satisfies anonymity and verifies the correctness and feasibility of the new framework. Copyright (C) 2014 John Wiley & Sons, Ltd.
引用
收藏
页码:1132 / 1140
页数:9
相关论文
共 19 条
[1]  
Brickell E., 2004, P ACM C COMP COMM SE, P132, DOI DOI 10.1109/TSC.2010.60
[2]  
Comon-Lundh Hubert, 2012, Information Security Practice and Experience. Proceedings of the 8th International Conference, ISPEC 2012, P63, DOI 10.1007/978-3-642-29101-2_5
[3]  
Comon-Lundh H, 2008, CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P109
[4]   Protocol Composition Logic (PCL) [J].
Datta, Anupam ;
Derek, Ante ;
Mitchell, John C. ;
Roy, Arnab .
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 172 :311-358
[5]   ON THE SECURITY OF PUBLIC KEY PROTOCOLS [J].
DOLEV, D ;
YAO, AC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) :198-208
[6]  
Dong Xue-wen, 2011, Journal on Communications, V32, P124
[7]   Automatic testing equivalence verification of spi calculus specifications [J].
Durante, L ;
Sisto, R ;
Valenzano, A .
ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2003, 12 (02) :222-284
[8]  
Hajiabadi M, 2013, LECT NOTES COMPUT SC, V7785, P539, DOI 10.1007/978-3-642-36594-2_30
[9]  
Halpern JY, 2005, J COMPUT SECUR, V13, P483
[10]  
Hughes D., 2004, Journal of Computer Security, V12, P3