Time, computational complexity, and probability in the analysis of distance-bounding protocols

Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott. Time, computational complexity, and probability in the analysis of distance-bounding protocols. Journal of Computer Security, 25(6):585-630, 2017. [doi]

Abstract

Abstract is missing.