Filters








49 Hits in 5.4 sec

The Swiss-Knife RFID Distance Bounding Protocol [chapter]

Chong Hee Kim, Gildas Avoine, François Koeune, François-Xavier Standaert, Olivier Pereira
2009 Lecture Notes in Computer Science  
We also point out a weakness in Tu and Piramuthu's protocol, which was considered up to now as one of the most efficient distance bounding protocol.  ...  Distance bounding protocols represent a promising way to thwart relay attacks, by measuring the round trip time of short authenticated messages.  ...  In 2005, Hancke and Kuhn proposed a distance bounding protocol (HKP) [7] that has been chosen as a reference-point because it is the most popular distance bounding protocol in the RFID framework.  ... 
doi:10.1007/978-3-642-00730-9_7 fatcat:2zenheeylrfdrjxlk3t4g7nggu

Shedding Light on RFID Distance Bounding Protocols and Terrorist Fraud Attacks [article]

Pedro Peris-Lopez, Julio C. Hernandez-Castro, Christos Dimitrakakis, Aikaterini Mitrokotsa, Juan M. E. Tapiador
2010 arXiv   pre-print
Distance bounding protocols represent a promising countermeasure to hinder relay attacks.  ...  The vast majority of RFID authentication protocols assume the proximity between readers and tags due to the limited range of the radio channel.  ...  [18] proposed a distance bounding protocol (Swiss-Knife protocol), which was claimed to cover all security objectives expected from an RFID system.  ... 
arXiv:0906.4618v2 fatcat:o3orzslvy5bqlgdg5gg4qcxkui

On Selecting the Nonce Length in Distance-Bounding Protocols

A. Mitrokotsa, P. Peris-Lopez, C. Dimitrakakis, S. Vaudenay
2013 Computer journal  
Distance-bounding protocols form a family of challenge-response authentication protocols that have been introduced to thwart relay attacks.  ...  They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prover. We provide a detailed security analysis of a family of such protocols.  ...  Swiss-Knife [10] or any of the other three protocols [7] [8] [9] correspondingly).  ... 
doi:10.1093/comjnl/bxt033 fatcat:gdjhc4kaw5athdwnpensmrefxq

An Efficient Single-Slow-Phase Mutually Authenticated RFID Distance Bounding Protocol with Tag Privacy [chapter]

Anjia Yang, Yunhui Zhuang, Duncan S. Wong
2012 Lecture Notes in Computer Science  
available, for example, the Swiss-Knife protocol.  ...  Among the RFID distance bounding protocols in the literature, besides defending against various attacks such as impersonation, distance fraud, Mafia attack, terrorist attack, and distance hijacking, some  ...  There have been a handful of RFID distance bounding protocols proposed recently [1] [2] [3] [4] [5] [6] [7] .  ... 
doi:10.1007/978-3-642-34129-8_25 fatcat:g4k3nyql4bddbabcsv4yfxb4rq

Comparing distance bounding protocols: A critical mission supported by decision theory

Gildas Avoine, Sjouke Mauw, Rolando Trujillo-Rasua
2015 Computer Communications  
The methodology allows for a multi-criteria comparison of distance bounding protocols, thereby identifying the most appropriate protocols once the context is provided.  ...  Distance bounding protocols are security countermeasures designed to thwart relay attacks.  ...  This protocol was named the Swiss-knife distance-bounding protocol -in reference to the multi-tool Swiss army knife -due to its ability to deal with mafia, distance, and terrorist fraud at the same time  ... 
doi:10.1016/j.comcom.2015.06.007 fatcat:nliomyu4mzar5jmpmeasighcvy

Expected loss analysis of thresholded authentication protocols in noisy conditions [article]

Christos Dimitrakakis and Aikaterini Mitrokotsa and Serge Vaudenay
2010 arXiv   pre-print
This requires assigning an acceptable threshold for the number of detected errors. This paper describes a framework enabling an expected loss analysis for all the protocols in this family.  ...  A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting n rounds, with no error correction.  ...  Acknowledgements This work was partially supported by the Marie Curie IEF project "PPIDR: Privacy-Preserving Intrusion Detection and Response in Wireless Communications", grant number: 252323 and by the  ... 
arXiv:1009.0278v1 fatcat:qgrd3ip6cbfupbz7rcq2u4iyv4

Terrorism in Distance Bounding: Modeling Terrorist-Fraud Resistance [chapter]

Marc Fischlin, Cristina Onete
2013 Lecture Notes in Computer Science  
[7] is aimed at the protocols of Reid et al. [18] and the Swiss-Knife protocol [14] .  ...  Many distance-bounding protocols are designed for resource-constrained devices, e.g. RFID tags.  ...  Acknowledgments We thank the anonymous reviewers for valuable comments. This work was supported by CASED (www.cased.de).  ... 
doi:10.1007/978-3-642-38980-1_26 fatcat:jpxpswkbqffsjkz4hhvw4o7kre

Towards Secure Distance Bounding [chapter]

Ioana Boureanu, Aikaterini Mitrokotsa, Serge Vaudenay
2014 Lecture Notes in Computer Science  
In this work, we present distance-bounding protocols, how these can deter relay attacks, and the security models formalizing these protocols.  ...  As far as we know, this is the first protocol with such all-encompassing security guarantees.  ...  Acknowledgements We warmly thank Shiho Moriai, program chair of FSE'13, and her program committee, for inviting us to present our results on distance bounding. This work was partially supported by  ... 
doi:10.1007/978-3-662-43933-3_4 fatcat:nbjzbdseb5cylkmf74f5i7y6ua

A Secure Distance-Bounding Protocol with Mutual Authentication

Weiwei Liu, Hua Guo, Yangguang Tian, Yinghui Zhang
2021 Security and Communication Networks  
Currently, most of the existing distance-bounding protocols usually do not take the reuse of nonces in designing the protocols into consideration.  ...  Distance-bounding protocol is a useful primitive in resisting distance-based attacks.  ...  Acknowledgments is work was partially sponsored by the project of youth talent promotion in Henan Province under grant no. 2021HYTP011.  ... 
doi:10.1155/2021/6644326 fatcat:x5ctomsfxnauzfwo6b6d2o3jze

Here and There at Once, with my Mobile Phone!

Ioana Boureanu, David Gerault, James Lewis
2019 Proceedings of the 16th International Joint Conference on e-Business and Telecommunications  
Are the simplest proximity-based attacks, namely distance frauds, a practical danger? Can an attacker make it look like they are here and there at the same time?  ...  Second, we implement two "credible" distance frauds on off-the-shelf NFC-enabled Android phones. We present an initial evaluation focused on their feasibility.  ...  Preliminaries The Swiss-Knife Protocol In the Swiss-Knife protocol (Kim et al., 2008) (depicted in Fig. 1) , the prover and the verifier share a secret key x.  ... 
doi:10.5220/0007953004780484 dblp:conf/icete/BoureanuGL19 fatcat:42mo3tqxkzbb5lerzsepty3p7e

Security of Distance-Bounding

Gildas Avoine, Jorge Munilla, Alberto Peinado, Kasper Bonne Rasmussen, Dave Singelée, Aslan Tchamkerten, Rolando Trujillo-Rasua, Serge Vaudenay, Muhammed Ali Bingöl, Ioana Boureanu, Srdjan čapkun, Gerhard Hancke (+4 others)
2018 ACM Computing Surveys  
Distance bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity.  ...  This survey analyzes and compares in a unified manner many existing distance bounding protocols with respect to several key security and complexity features.  ...  Published Attacks Peris-Lopez et al. proposed a passive full disclosure attack on the Swiss-knife RFID distance-bounding protocol [60] .  ... 
doi:10.1145/3264628 fatcat:cn734ifv5fhczfjjviwexu7cti

Expected loss analysis for authentication in constrained channels

Christos Dimitrakakis, Aikaterini Mitrokotsa, Serge Vaudenay
2015 Journal of Computer Security  
These bounds are tight, as shown by a matching lower bound. Finally, a method to adaptively select both the number of rounds and the threshold is proposed for a certain class of protocols.  ...  We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs.  ...  Acknowledgements We would like to extend thanks to the anonymous reviewers, whose insightful comments led to significant improvements in the manuscript.  ... 
doi:10.3233/jcs-140521 fatcat:gigj77rowncfner3kmotsv6kmq

Expected loss bounds for authentication in constrained channels

Christos Dimitrakakis, Aikaterini Mitrokotsa, Serge Vaudenay
2012 2012 Proceedings IEEE INFOCOM  
These bounds are tight, as shown by a matching lower bound. Finally, a method to adaptively select both the number of rounds and the threshold is proposed for a certain class of protocols.  ...  We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs.  ...  ACKNOWLEDGEMENTS This work was partially supported by the Marie Curie IEF project "PPIDR: Privacy-Preserving Intrusion Detection and Response in Wireless Communications", grant number: 252323, the Marie  ... 
doi:10.1109/infcom.2012.6195788 dblp:conf/infocom/DimitrakakisMV12 fatcat:x6gle2muefhnxjyssplbp423zu

On Modeling Terrorist Frauds [chapter]

Serge Vaudenay
2013 Lecture Notes in Computer Science  
Quite recently, distance-bounding protocols received a lot of attention as they offer a good solution to thwart relay attacks.  ...  Both were proposed with a provably secure distance-bounding protocols (FO and SKI, respectively) providing security against all state-of-the-art threat models.  ...  Acknowledgements The author thanks Marc Fischlin and Cristina Onete for their feedbacks. Also: many thanks to Ioana Boureanu for some memorable discussions about terrorism in distance bounding.  ... 
doi:10.1007/978-3-642-41227-1_1 fatcat:ttw3ifat7jgsba2jtb6w6cmmgi

On the Pseudorandom Function Assumption in (Secure) Distance-Bounding Protocols [chapter]

Ioana Boureanu, Aikaterini Mitrokotsa, Serge Vaudenay
2012 Lecture Notes in Computer Science  
In this paper, we show that many formal and informal security results on distance-bounding (DB) protocols are incorrect/ incomplete.  ...  Whilst our examples may be considered contrived, the overall message is clear: the PRF assumption should be strengthened in order to attain security against distance-fraud and MiM attacks in distance-bounding  ...  The Swiss-Knife Protocol In the Swiss-Knife protocol [12] (depicted in Fig. 9 ), the prover and the verifier share a secret key x.  ... 
doi:10.1007/978-3-642-33481-8_6 fatcat:x4iwzo7gcjevni5rrl5xn64k5i
« Previous Showing results 1 — 15 out of 49 results