CryptoDB
Games and the Impossibility of Realizable Ideal Functionality
| Authors: | |
|---|---|
| Download: | |
| Abstract: | A cryptographic primitive or a security mechanism can be specified in a variety of ways, such as a condition involving a game against an attacker, construction of an ideal functionality, or a list of properties that must hold in the face of attack. While game conditions are widely used, an ideal functionality is appealing because a mechanism that is indistinguishable from an ideal functionality is therefore guaranteed secure in any larger system that uses it. We relate ideal functionalities to games by defining the \textit{set} of ideal functionalities associated with a game condition and show that under this definition, which reflects accepted use and known examples, bit commitment, a form of group signatures, and some other cryptographic concepts do not have any realizable ideal functionality. |
BibTeX
@misc{eprint-2005-12546,
title={Games and the Impossibility of Realizable Ideal Functionality},
booktitle={IACR Eprint archive},
keywords={foundations / universaly composability, bit commitment, group signatures, symmetric encryption},
url={http://eprint.iacr.org/2005/211},
note={Third Theory of Cryptography Conference, TCC 2006, Proceedings aderek@cs.stanford.edu 13217 received 5 Jul 2005, last revised 9 Mar 2006},
author={Anupam Datta and Ante Derek and John C. Mitchell and Ajith Ramanathan and Andre Scedrov},
year=2005
}