On Equivalences, Metrics, and Polynomial Time

Alberto Cappai 1, 2 Ugo Dal Lago 2, 1
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : 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.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01231790
Contributor : Ugo Dal Lago <>
Submitted on : Friday, November 20, 2015 - 4:47:47 PM
Last modification on : Wednesday, October 10, 2018 - 10:09:26 AM
Long-term archiving on : Friday, April 28, 2017 - 4:49:28 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

262

Files downloads

186