How to Securely Release Unverified Plaintext in Authenticated Encryption

被引:0
|
作者
Andreeva, Elena [1 ,2 ]
Bogdanov, Andrey [3 ]
Luykx, Atul [1 ,2 ]
Mennink, Bart [1 ,2 ]
Mouha, Nicky [1 ,2 ]
Yasuda, Kan [1 ,4 ]
机构
[1] Katholieke Univ Leuven, ESAT COSIC, Dept Elect Engn, Louvain, Belgium
[2] iMinds, Louvain, Belgium
[3] Tech Univ Denmark, Dept Math, Odense, Denmark
[4] NTT Secure Platform Labs, Tokyo, Japan
关键词
SECURITY TREATMENT; SINGLE-KEY; MODE; CBC;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Scenarios in which authenticated encryption schemes output decrypted plaintext before successful verification raise many security issues. These situations are sometimes unavoidable in practice, such as when devices have insufficient memory to store an entire plaintext, or when a decrypted plaintext needs early processing due to real-time requirements. We introduce the first formalization of the releasing unverified plaintext (RUP) setting. To achieve privacy, we propose using plaintext awareness (PA) along with IND-CPA. An authenticated encryption scheme is PA if it has a plaintext extractor, which tries to fool adversaries by mimicking the decryption oracle, without the secret key. Releasing unverified plaintext to the attacker then becomes harmless as it is infeasible to distinguish the decryption oracle from the plaintext extractor. We introduce two notions of plaintext awareness in the symmetric-key setting, PA1 and PA2, and show that they expose a new layer of security between IND-CPA and IND-CCA. To achieve integrity, INT-CTXT in the RUP setting is required, which we refer to as INT-RUP. These new security notions are compared with conventional definitions, and are used to make a classification of symmetric-key schemes in the RUP setting. Furthermore, we re-analyze existing authenticated encryption schemes, and provide solutions to fix insecure schemes.
引用
收藏
页码:105 / 125
页数:21
相关论文
共 50 条
  • [21] Plaintext checkable encryption with check delegation revisited
    Chen, Yu-Chi
    [J]. INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2020, 34 (02) : 102 - 110
  • [22] Reforgeability of Authenticated Encryption Scheme
    Forler, Christian
    List, Eik
    Lucks, Stefan
    Wenzel, Jakob
    [J]. INFORMATION SECURITY AND PRIVACY, ACISP 2017, PT II, 2017, 10343 : 19 - 37
  • [23] Publicly verifiable authenticated encryption
    Ma, CS
    Chen, KF
    [J]. ELECTRONICS LETTERS, 2003, 39 (03) : 281 - 282
  • [24] Unconditionally secure authenticated encryption
    Shikata, J
    Hanaoka, G
    Zheng, YL
    Matsumoto, T
    Imai, H
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (05): : 1119 - 1131
  • [25] Authenticated Encryption with Variable Stretch
    Reyhanitabar, Reza
    Vaudenay, Serge
    Vizar, Damian
    [J]. ADVANCES IN CRYPTOLOGY - ASIACRYPT 2016, PT I, 2016, 10031 : 396 - 425
  • [26] A quantum authenticated encryption scheme
    Lü, X
    Ma, Z
    Feng, DG
    [J]. 2004 7TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, VOLS 1-3, 2004, : 2306 - 2309
  • [27] WAGE: An Authenticated Encryption with a Twist
    AlTawy, Riham
    Gong, Guang
    Mandal, Kalikinkar
    Rohit, Raghvendra
    [J]. IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2020, 2020 : 132 - 159
  • [28] Convertible authenticated encryption scheme
    Wu, TS
    Hsu, CL
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2002, 62 (03) : 205 - 209
  • [29] The FCM Scheme for Authenticated Encryption
    Lei, Xiaomei
    Wu, Zhongdong
    Yong, Jiu
    [J]. PROCEEDINGS OF THE 2017 5TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND COMPUTING TECHNOLOGY (ICMMCT 2017), 2017, 126 : 1123 - 1129
  • [30] On Committing Authenticated-Encryption
    Chan, John
    Rogaway, Phillip
    [J]. COMPUTER SECURITY - ESORICS 2022, PT II, 2022, 13555 : 275 - 294