[Resource Topic] 2005/211: Games and the Impossibility of Realizable Ideal Functionality

Welcome to the resource topic for 2005/211

Games and the Impossibility of Realizable Ideal Functionality

Authors: Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov


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.

ePrint: https://eprint.iacr.org/2005/211

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .