2010/11/24 by Karim M. El Defrawy, Karim El Defrawy, Defrawy, Karim El +5
Computer Science · #Context-Aware Activity Recognition Systems #Cryptography and Security (cs.CR) #Energy Efficient Wireless Sensor Networks #FOS: Computer and information sciences #Mobile Ad Hoc Networks #cs.CR
paper · pdf · doi:10.48550/arxiv.1011.5295
arxiv created 2010/11/24 · openalex publication_date 2010/11/24 · arxiv updated 2010/11/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Secure 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. GDB is also useful in mission-critical networks and automotive computer systems. This paper addresses, for the first time, GDB protocols by utilizing the new passive DB primitive and the novel mutual multi-party GDB protocol. We show how they can be used to construct secure and efficient GDB protocols for various settings. We analyze security and performance of our protocols and compare them with existing DB techniques when applied to group settings.