EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Secure verification of location claims
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
An RFID Distance Bounding Protocol
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Keep your enemies close: distance bounding against smartcard relay attacks
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
GAnGS: gather, authenticate 'n group securely
Proceedings of the 14th ACM international conference on Mobile computing and networking
Location privacy of distance bounding protocols
Proceedings of the 15th ACM conference on Computer and communications security
Secure and precise location verification using distance bounding and simultaneous multilateration
Proceedings of the second ACM conference on Wireless network security
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Secure verification of location claims with simultaneous distance modification
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
ID-based secure distance bounding and localization
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Realization of RF distance bounding
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
IEEE Communications Magazine
| Hi-index | 0.00 |
Distance bounding (DB) protocols allow one entity, the verifier, to securely obtain an upper-bound on the distance to another entity, the prover. Thus far, DB was considered mostly in the context of a single prover and a single verifier. There has been no substantial prior work on secure DB in group settings, where a set of provers interact with a set of verifiers. The need for group distance bounding (GDB) is motivated by many practical scenarios, including: group device pairing, location-based access control and secure distributed localization. This paper addresses, for the first time, one-way GDB protocols by utilizing a new passive DB primitive. We show how passive DB can be used to construct secure and efficient GDB protocols for various one-way GDB settings. We analyze the security and performance of proposed protocols and compare them with existing DB techniques extended to group settings.