Browser-based distance-bounding demo — relay an HMAC challenge-response across any distance and it still authenticates, then run Hancke–Kuhn's timed single-bit rounds against relay, mafia pre-ask, and distance fraud, with every attack probability as an exact BigInt fraction and a too-generous delay bound that pulls a far prover closer
cryptography cryptanalysis authentication rfid crypto-lab distance-bounding relay-attack mafia-fraud
-
Updated
Nov 18, 2026 - TypeScript