On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments

Résumé

A system of session types is introduced as induced by a Curry Howard correspondence applied to bounded linear logic, suitably extended with probabilistic choice operators and ground types. The resulting system satisfies some expected properties, like subject reduction and progress, but also unexpected ones, like a polynomial bound on the time needed to reduce processes. This makes the system suitable for modelling experiments and proofs from the so-called computational model of cryptography.
Fichier principal
Vignette du fichier
concur2022.pdf (772.25 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03921809 , version 1 (04-01-2023)

Identifiants

  • HAL Id : hal-03921809 , version 1

Citer

Ugo Dal Lago, Giulia Giusti. On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments. CONCUR 2022 - 33rd International Conference on Concurrency Theory, Sep 2022, Warsaw, Poland. ⟨hal-03921809⟩
27 Consultations
20 Téléchargements

Partager

Gmail Facebook X LinkedIn More