Decidability of a Sound Set of Inference Rules for Computational Indistinguishability - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Decidability of a Sound Set of Inference Rules for Computational Indistinguishability

Résumé

Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations. We follow Bana and Comon's approach, axiomatizing what an adversary cannot distinguish. We prove the decidability of a set of first-order axioms which are computationally sound, though incomplete, for protocols with a bounded number of sessions whose security is based on an IND-CCA2 encryption scheme. Alternatively, our result can be viewed as the decidability of a family of cryptographic game transformations. Our proof relies on term rewriting and automated deduction techniques.
Fichier principal
Vignette du fichier
strat.pdf (402.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04392610 , version 1 (13-01-2024)

Licence

Paternité

Identifiants

Citer

Adrien Koutsos. Decidability of a Sound Set of Inference Rules for Computational Indistinguishability. 2019 IEEE 32nd Computer Security Foundations Symposium (CSF), Jun 2019, Hoboken, France. pp.48-4813, ⟨10.1109/CSF.2019.00011⟩. ⟨hal-04392610⟩
1 Consultations
6 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More