Efficient Public-Key Distance Bounding Protocol

DOI10.1007/978-3-662-53890-6_29zbMath1407.94129OpenAlexW2550711931MaRDI QIDQ2953799

Handan Kılınç, Serge Vaudenay

Publication date: 6 January 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_29

zbMATH Keywords

RFIDkey agreementrelay attackdistance boundingNFCdistance frauddistance hijackingmafia fraud

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

A Symbolic Framework to Analyse Physical Proximity in Security Protocols

Uses Software

• HMQV
• NAXOS

Cites Work

• Unnamed Item
• Unnamed Item
• Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
• An efficient protocol for authenticated key agreement
• Optimal Proximity Proofs Revisited
• Secure and Lightweight Distance-Bounding
• On Modeling Terrorist Frauds
• Towards Secure Distance Bounding
• Optimal Proximity Proofs
• On Privacy for RFID
• Sound Proof of Proximity of Knowledge
• Stronger Security of Authenticated Key Exchange
• New directions in cryptography
• On Privacy Models for RFID
• HMQV: A High-Performance Secure Diffie-Hellman Protocol
• Public Key Cryptography - PKC 2006

This page was built for publication: Efficient Public-Key Distance Bounding Protocol