A note on adversary running times

Amit Sahai

Paper 2026/245

A note on adversary running times

Amit Sahai

, University of California, Los Angeles

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.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
Keywords: complexity classes
Contact author(s): amitsahai @ gmail com
History: 2026-02-16: approved; 2026-02-13: received; See all versions
Short URL: https://ia.cr/2026/245
License: CC BY

BibTeX

@misc{cryptoeprint:2026/245,
      author = {Amit Sahai},
      title = {A note on adversary running times},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/245},
      year = {2026},
      url = {https://eprint.iacr.org/2026/245}
}