Communication Dans Un Congrès Année : 2025

On Computational Indistinguishability and Logical Relations

Résumé

λ-calculus is introduced in which all programs can be evaluated in probabilistic polynomial time and in which there is sufficient structure to represent sequential cryptographic constructions and adversaries for them, even when the latter are oracle-based. A notion of observational equivalence capturing computational indistinguishability and a class of approximate logical relations are then presented, showing that the latter represent a sound proof technique for the former. The work concludes with the presentation of an example of a security proof in which the encryption scheme induced by a pseudorandom function is proven secure against active adversaries in a purely equational style.
Fichier principal
Vignette du fichier
aplasfinal.pdf (671) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04834943 , version 1 (12-12-2024)

Licence

Identifiants

Citer

Ugo Dal Lago, Zeinab Galal, Giulia Giusti. On Computational Indistinguishability and Logical Relations. APLAS 2024 - 22nd Asian Symposium on Programming Languages and Systems, Oct 2024, Kyoto, Japan. pp.241-263, ⟨10.1007/978-981-97-8943-6_12⟩. ⟨hal-04834943⟩
14 Consultations
5 Téléchargements

Altmetric

Partager

More