A note on adversary running times

Download PDF
Open Webpage

Amit Sahai

Published: 2026, Last Modified: 28 May 2026IACR Cryptol. ePrint Arch. 2026EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this note, we consider a perspective on adversary running times that fixes the adversary's running time to be $2^\kappa$, and then asks: to achieve security against such an adversary, what running time in terms of $\kappa$ do honest parties need? This perspective gives rise to a new natural class of adversary running times that we call \emph{quasi-exponential} time adversaries.