Publication | Closed Access
Distance Bounding Protocol with Adjustable False Acceptance Rate
21
Citations
8
References
2011
Year
EngineeringInformation SecurityInformation ForensicsCommunication ComplexityMafia Fraud AttackProtocol ComplianceCommunicationInformation Theoretic SecuritySecure CommunicationDistance Fraud AttackData PrivacyComputer ScienceCommunication AlgorithmData SecurityCryptographyNetwork Communication ProtocolDistance Bounding ProtocolsAttack ModelDistance Bounding Protocol
At Eurocrypt 1993, Brands and Chaum introduced distance bounding protocols to defend against mafia fraud attack and distance fraud attack. A distance bounding protocol usually consists of n rounds of a single-bit challenge and a single-bit response, which determines the distance between communicating entities by measuring the round-trip time of signals. Let FAR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</sub> and FAR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</sub> be the false acceptance rate against the mafia fraud attack and the distance fraud attack, respectively. The state-of-the-art distance bounding protocols in terms of the false acceptance rate have either (FAR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</sub> ,FAR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</sub> ) = ((1/2) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> , (1/2) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> ) or (FAR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</sub> ,FAR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</sub> ) = (4(3/8) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> , (7/8) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> ). We introduce a flexible distance bounding protocol whose false acceptance rate (FAR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</sub> ,FAR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</sub> ) can be chosen from ((1/2) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> , (1/2) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> ) to ((1/4) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> , (3/4) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> ).
| Year | Citations | |
|---|---|---|
Page 1
Page 1