We defined a new notion of computational indistinguishability: termination-insensitive computational indistinguishability (tic-indistinguishability). Tic-indistinguishability models indistinguishability with respect to distinguishers that cannot distinguish between termination and non-termination. We sketch how the new notion allows to get computational soundness results of symbolic models for equivalence-based security properties(such as anonymity) for processes that contain loops, solving an open problem.
['Dominique Unruh']
Termination-Insensitive Computational Indistinguishability (and Applications to Computational Soundness)