arXiv · 2610.14739
(Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography
Abstract
In this paper, we show how a recently introduced $λ$-calculus for randomized computation, called $λ\mathbf{BLL}$, can accurately capture the notions of first- and second-order polytime computations used in cryptographic definitions and proofs. These results, spelled out in the style of so-called \emph{implicit computational complexity}, imply that $λ\mathbf{BLL}$ is sufficiently powerful to express experiments and adversaries as used in cryptography, and that reductions, when formulated within the calculus, are guaranteed to be complexity-preserving. Remarkably, while polynomial-time soundness holds for the full calculus, polynomial-time completeness already follows in presence of a minimal finite set of basic functions.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ugo Dal Lago, Giulia Giusti. 2026-10-10. (Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography. https://searcharxiv.com/abs/2610.14739
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.