Post-Collusion Security and Distance Bounding

被引:5
作者
Mauw, Sjouke [1 ,2 ]
Smith, Zach [1 ]
Toro-Pozo, Jorge [3 ]
Trujillo-Rasua, Rolando [4 ]
机构
[1] Univ Luxembourg, Luxembourg, Luxembourg
[2] SnT, Luxembourg, Luxembourg
[3] Swiss Fed Inst Technol, Zurich, Switzerland
[4] Deakin Univ, Sch Informat Technol, Geelong, Vic, Australia
来源
PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19) | 2019年
关键词
security protocols; formal verification; collusion; distance bounding; terrorist fraud; AUTHENTICATION; PROTOCOLS; CHALLENGES;
D O I
10.1145/3319535.3345651
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Verification of cryptographic protocols is traditionally built upon the assumption that participants have not revealed their long-term keys. However, in some cases, participants might collude to defeat some security goals, without revealing their long-term secrets. We develop a model based on multiset rewriting to reason about collusion in security protocols. We introduce the notion of post-collusion security, which verifies security properties claimed in sessions initiated after the collusion occurred. We use post-collusion security to analyse terrorist fraud on protocols for securing physical proximity, known as distance-bounding protocols. In a terrorist fraud attack, agents collude to falsely prove proximity, whilst no further false proximity proof can be issued without further collusion. Our definitions and the TAMARIN prover are used to develop a modular framework for verification of distance-bounding protocols that accounts for all types of attack from literature. We perform a survey of over 25 protocols, which include industrial protocols such as Mastercard's contactless payment PayPass and NXP's MIFARE Plus with proximity check. For the industrial protocols we confirm attacks, propose fixes, and deliver computer-verifiable security proofs of the repaired versions.
引用
收藏
页码:941 / 958
页数:18
相关论文
共 59 条
[1]  
[Anonymous], C THEOR APPL CRYPT
[2]   Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries [J].
Aumann, Yonatan ;
Lindell, Yehuda .
JOURNAL OF CRYPTOLOGY, 2010, 23 (02) :281-343
[3]   Security of Distance-Bounding: A Survey [J].
Avoine, Gildas ;
Bingol, Muhammed Ali ;
Boureanu, Ioana ;
Capkun, Srdjan ;
Hancke, Gerhard ;
Kardas, Suleyman ;
Kim, Chong Hee ;
Lauradoux, Cedric ;
Martin, Benjamin ;
Munilla, Jorge ;
Peinado, Alberto ;
Rasmussen, Kasper Bonne ;
Singelee, Dave ;
Tchamkerten, Aslan ;
Trujillo-Rasua, Rolando ;
Vaudenay, Serge .
ACM COMPUTING SURVEYS, 2019, 51 (05)
[4]   A Terrorist-fraud Resistant and Extractor-free Anonymous Distance-bounding Protocol [J].
Avoine, Gildas ;
Bultel, Xavier ;
Gambs, Sebastien ;
Gerault, David ;
Lafourcade, Pascal ;
Onete, Cristina ;
Robert, Jean-Marc .
PROCEEDINGS OF THE 2017 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (ASIA CCS'17), 2017, :800-814
[5]   Comparing distance bounding protocols: A critical mission supported by decision theory [J].
Avoine, Gildas ;
Mauw, Sjouke ;
Trujillo-Rasua, Rolando .
COMPUTER COMMUNICATIONS, 2015, 67 :92-102
[6]   A framework for analyzing RFID distance bounding protocols [J].
Avoine, Gildas ;
Bingol, Muhammed Ali ;
Kardas, Suleyman ;
Lauradoux, Cedric ;
Martin, Benjamin .
JOURNAL OF COMPUTER SECURITY, 2011, 19 (02) :289-317
[7]  
Avoine G, 2011, WISEC 11: PROCEEDINGS OF THE FOURTH ACM CONFERENCE ON WIRELESS NETWORK SECURITY, P145
[8]  
Avoine G, 2009, LECT NOTES COMPUT SC, V5735, P250, DOI 10.1007/978-3-642-04474-8_21
[9]   A Formal Analysis of 5G Authentication [J].
Basin, David ;
Dreier, Jannik ;
Hirschi, Lucca ;
Radomirovic, Sasa ;
Sasse, Ralf ;
Stettler, Vincent .
PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, :1383-1396
[10]   Modeling Human Errors in Security Protocols [J].
Basin, David ;
Radomirovic, Sasa ;
Schmid, Lara .
2016 IEEE 29TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2016), 2016, :325-340