Paper 2010/505 Original: eprint.iacr.org/2010/505 ↗
Termination-Insensitive Computational Indistinguishability (and applications to computational soundness)
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- Category
- Foundations
- Publication info
- Preprint.
- History
- 2010-10-05: last updated
- 2010-10-05: published
- Short URL
- https://ia.cr/2010/505
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/505,
author = {Dominique Unruh},
title = {Termination-Insensitive Computational Indistinguishability (and applications to computational soundness)},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/505},
year = {2010},
url = {https://eprint.iacr.org/2010/505}
}