Games and the Impossibility of Realizable Ideal Functionality

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 set of ideal functionalities associated with a game condition and show that under this definition, which reflects accepted use and known examples, a number of cryptographic concepts do not have any realizable ideal functionality in the plain model. Some interesting examples are multiparty coin-tossing, bit-commitment and shared random sequences. One interpretation of this negative result is that equational approaches based on computational observational equivalence might be better applied to reasoning about game conditions than equivalence with ideal functionalities. Alternatively, generality might be obtained by allowing for various setup assumptions, or by other means.
Type de document :
Communication dans un congrès
Véronique Cortier et Steve Kremer. Workshop on Formal and Computational Cryptography (FCC 2006), Jul 2006, Venice/Italy, 2006
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00080683
Contributeur : Véronique Cortier <>
Soumis le : mardi 20 juin 2006 - 10:27:34
Dernière modification le : mardi 31 octobre 2017 - 14:22:18
Document(s) archivé(s) le : lundi 5 avril 2010 - 23:07:15

Fichier

Identifiants

  • HAL Id : inria-00080683, version 1

Collections

Citation

Michael Backes, Anupam Datta, Ante Derek, John Mitchell, Ajith Ramanathan, et al.. Games and the Impossibility of Realizable Ideal Functionality. Véronique Cortier et Steve Kremer. Workshop on Formal and Computational Cryptography (FCC 2006), Jul 2006, Venice/Italy, 2006. 〈inria-00080683〉

Partager

Métriques

Consultations de la notice

85

Téléchargements de fichiers

267