1970-01-01

(2026-02) A note on adversary running times

• [[Amit Sahai]]

2026-02-13

• #cryptography
• #paper

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.