Cryptology ePrint Archive: Report 2010/505

Termination-Insensitive Computational Indistinguishability (and applications to computational soundness)

Dominique Unruh

Abstract: 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.

Category / Keywords: foundations / computational indistinguishability, non-termination, computational soundness

Date: received 3 Oct 2010

Contact author: unruh at mmci uni-saarland de

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20101005:143346 (All versions of this report)

Short URL: ia.cr/2010/505

Discussion forum: Show discussion | Start new discussion