arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.14739cs.PLcs.CR
收藏

密码学中使用的概率多项式时间的(隐式)刻画

(Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography

University of Bologna(博洛尼亚大学)

Ugo Dal Lago, Giulia Giusti

AI总结:

本文提出λBLL演算可刻画密码学中的一阶和二阶多项式时间计算,能表达密码学实验与敌手,且归约可保持复杂性,仅需极小有限基本函数集即可实现多项式时间完备性。

摘要:

本文展示了一种新近引入的用于随机计算的λ演算λBLL,可准确捕捉密码学定义与证明中使用的一阶和二阶多项式时间计算概念。这些以所谓“隐式计算复杂性”风格阐述的结果表明,λBLL足以表达密码学中使用的实验与敌手,且在该演算内表述的归约保证保持复杂性。值得注意的是,尽管完整演算满足多项式时间可靠性,但仅需存在极小有限基本函数集即可推出多项式时间完备性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑