You are looking at a specific version 20101005:143346 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- PDF PS
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- computational indistinguishabilitynon-terminationcomputational soundness
- Contact author(s)
- unruh @ mmci uni-saarland de
- History
- 2010-10-05: received
- Short URL
- https://ia.cr/2010/505
- License
-
CC BY