On Equivalences, Metrics, and Polynomial Time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

On Equivalences, Metrics, and Polynomial Time


Interactive behaviors are ubiquitous in modern cryptography, but are also present in λ-calculi, in the form of higher-order constructions. Traditionally, however, typed λ-calculi simply do not fit well into cryptography , being both deterministic and too powerful as for the complexity of functions they can express. We study interaction in a λ-calculus for probabilistic polynomial time computable functions. In particular, we show how notions of context equivalence and context metric can both be characterized by way of traces when defined on linear contexts. We then give evidence on how this can be turned into a proof methodology for computational indistinguishability, a key notion in modern cryptography. We also hint at what happens if a more general notion of a context is used.
Fichier principal
Vignette du fichier
main.pdf (376.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01231790 , version 1 (20-11-2015)



Alberto Cappai, Ugo Dal Lago. On Equivalences, Metrics, and Polynomial Time. FCT 2015, Aug 2015, Gdansk, Poland. pp.311-323, ⟨10.1007/978-3-319-22177-9_24⟩. ⟨hal-01231790⟩
143 View
130 Download



Gmail Facebook X LinkedIn More