MMM: Authenticated Encryption with Minimum Secret State for Masking

被引:0
|
作者
Naito Y. [1 ]
Sasaki Y. [2 ]
Sugawara T. [3 ]
机构
[1] Mitsubishi Electric Corporation, Kanagawa
[2] NTT Social Informatics Laboratories, Tokyo
[3] The University of Electro-Communications, Tokyo
关键词
Authenticated Encryption; Masking; Mode of Operation; Multi-User Security; Side-Channel Attack;
D O I
10.46586/tches.v2023.i4.80-109
中图分类号
学科分类号
摘要
We propose a new authenticated encryption (AE) mode MMM that achieves the minimum memory size with masking. Minimizing the secret state is the crucial challenge in the low-memory AE suitable for masking. Here, the minimum secret state is s + b bits, composed of s bits for a secret key and b bits for a plaintext block. HOMA appeared in CRYPTO 2022 achieved this goal with b = 64, but choosing a smaller b was difficult because b = s/2 is bound to the block size of the underlying primitive, meaning that a block cipher with an unrealistically small block size (e.g., 8 bits) is necessary for further improvement. MMM addresses the issue by making b independent of the underlying primitive while achieving the minimum (s + b)-bit secret state. Moreover, MMM provides additional advantages over HOMA, including (i) a better rate, (ii) the security under the multi-user model, (iii) and a smaller transmission cost. We instantiate two variants, MMM-8 (with b = 8) and MMM-64 (with b = 64), using the standard tweakable block cipher SKINNY-64/192. With a (d + 1)-masking scheme, MMM-8 (resp. MMM-64) is smaller by 56d + 184 (resp. 128) bits compared with HOMA. As a result of hardware performance evaluation, MMM-8 and MMM-64 achieved smaller circuit areas than HOMA with all the examined protection orders d ∈ [0, 5]. MMM-8’s circuit area is only 81% of HOMA with d = 5, and MMM-64 achieves more than ×3 speed-up with a smaller circuit area. © 2023, Ruhr-University of Bochum. All rights reserved.
引用
收藏
页码:80 / 109
页数:29
相关论文
共 50 条
  • [1] Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
    Granger, Robert
    Jovanovic, Philipp
    Mennink, Bart
    Neves, Samuel
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT I, 2016, 9665 : 263 - 293
  • [2] Security Infrastructure of FANET Based on Secret Sharing and Authenticated Encryption
    Shenets, N. N.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2019, 53 (08) : 857 - 864
  • [3] Security Infrastructure of FANET Based on Secret Sharing and Authenticated Encryption
    N. N. Shenets
    Automatic Control and Computer Sciences, 2019, 53 : 857 - 864
  • [4] Parallelizable Authenticated Encryption with Small State Size
    Inoue, Akiko
    Minematsu, Kazuhiko
    SELECTED AREAS IN CRYPTOGRAPHY - SAC 2019, 2020, 11959 : 618 - 644
  • [5] Permutation-Based Deterministic Authenticated Encryption with Minimum Memory Size
    Hiraga, Yukihito
    Naito, Yusuke
    Sasaki, Yu
    Sugawara, Takeshi
    INFORMATION SECURITY, ISC 2023, 2023, 14411 : 351 - 371
  • [6] A Forgery Attack on Leaked-State Authenticated Encryption
    Mao, Jieshen
    Mu, Daoguang
    Lai, Xuejia
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON ELECTRONIC SCIENCE AND AUTOMATION CONTROL, 2015, 20 : 128 - 131
  • [7] Identity-based authenticated broadcast encryption and distributed authenticated encryption
    Mu, Y
    Susilo, W
    Lin, YX
    Ruan, C
    ADVANCES IN COMPUTER SCIENCE - ASIAN 2004, PROCEEDINGS, 2004, 3321 : 169 - 181
  • [8] The Emergence of Authenticated Encryption
    Rogaway, Phillip
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2014, 2014, 8479
  • [9] Indifferentiable Authenticated Encryption
    Barbosa, Manuel
    Farshim, Pooya
    ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT I, 2018, 10991 : 187 - 220
  • [10] Publicly verifiable authenticated encryption
    Ma, CS
    Chen, KF
    ELECTRONICS LETTERS, 2003, 39 (03) : 281 - 282