Towards Optimally Secure Deterministic Authenticated Encryption Schemes
Yu Long Chen, Avijit Dutta, Ashwin Jha, Mridul Nandi
摘要
The public comments received for the review process for NIST (SP) 800-38A pointed out two important issues that most companies face: (1) the limited security that AES can provide due to its 128-bit block size and (2) the problem of nonce-misuse in practice. In this paper, we provide an alternative solution to these problems by introducing two optimally secure deterministic authenticated encryption (DAE) schemes, denoted as DENC1 and DENC2 respectively. We show that our proposed constructions improve the state-of-the-art in terms of security and efficiency. Specifically, DENC1 achieves a robust security level of , while DENC2 attains a near-optimal security level of , where is the total number of blocks, is maximum number of blocks in each query, and is a user-defined parameter closely related to the rate of the construction. Our research centers on the development of two IV-based encryption schemes, referred to as IV1 and IV2, which respectively offer security levels of and . Notably, both of our DAE proposals are nearly rate 1/2 constructions. In terms of efficiency, our proposals compare favorably with state-of-the-art AE modes on contemporary microprocessors.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Making GCM Great Again: Toward Full Security and Longer NoncesWoohyuk Chung, Seongha Hwang, Seongkwang Kim, Byeonghak Lee 等EUROCRYPT 2025 · 被引用 2 次
- Efficient Schemes for Committing Authenticated EncryptionMihir Bellare, Viet Tung HoangEUROCRYPT 2022 · 被引用 54 次
- : A Domain-Extended Committing BBB PRF for Strengthening GCMRitam Bhaumik, Jean Paul Degabriele, Chandranan DharCRYPTO 2026
- Key Committing Security of HCTR2, RevisitedDonghoon Chang, Yu Long Chen, Yukihito Hiraga, Kazuhiko Minematsu 等CRYPTO 2026
- Generic Attack on Duplex-Based AEAD Modes Using Random Function StatisticsHenri Gilbert, Rachelle Heim Boissier, Louiza Khati, Yann RotellaEUROCRYPT 2023 · 被引用 5 次
