arXiv (All)
open access
(Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography
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 \em
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- NP-hardness of ideal lattice problems#1109858
- Truly Sub-$3^n$ Min-Sum Subset Convolution and Join Ordering#1227422
- Randomness Improvements for Security Protocols#399437
- Discrete mathematics through applications#1331773
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs#635508
Record · ID 1325635
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive