Guessing Attacks in the pi-calculus with a Computational Justification

This paper presents an extension of the pi-calculus that can reason about brute force and guessing attacks. We relate new name declarations in the pi-calculus with random sampling in the computational model of security. The scope of a new name can then be expanded at a comparable cost as it would take to guess the randomly sampled value in the computational setting. We provide a syntax and reduction semantics for this system and a function that calculates the cost of a given attack, taking into account the ease with which the attacker can confirm their guesses