搜索结果: 1-10 共查到“密码学 AE”相关记录10条 . 查询时间(0.056 秒)
The customary formulation of authenticated encryption (AE) requires the decrypting party to supply the correct nonce with each ciphertext it decrypts. To enable this, the nonce is often sent in the cl...
Lilliput-AE is a tweakable block cipher submitted as a candidate to the NIST lightweight cryptography standardization process. It is based upon the lightweight block cipher Lilliput, whose cryptanalys...
Practical Key-recovery Attacks on Round-Reduced Ketje Jr, Xoodoo-AE and Xoodyak
Conditional Cube Attack Keccak Ketje Jr
2019/5/9
Conditional cube attack was proposed by Huang et al. at EUROCRYPT 2017 to attack Keccak keyed mode. Inspired by dynamic cube attack, they reduce the degree by appending key bit conditions on the initi...
Reducing the Cost of Authenticity with Leakages: a CIML2-Secure AE Scheme with One Call to a Strongly Protected Tweakable Block Cipher
Leakage-resilience authenticated encryption leveled implementation
2019/5/9
This paper presents CONCRETE (Commit-Encrypt-Send-the-Key) a new Authenticated Encryption mode that offers CIML2 security, that is, ciphertext integrity in the presence of nonce misuse and side-channe...
Key-dependent cube attack on reduced Frit permutation in Duplex-AE modes
Frit Duplex authenticated encryption mode Key-dependent cube attack
2019/2/25
Frit is a new lightweight 384-bit cryptographic permutation proposed by Simon et al., which is designed for resisting fault injection and performs competitively in both hardware and software. Dobrauni...
To deal with message streams, which is required by many symmetric cryptographic functionalities (MAC, AE, HASH), we propose a lightweight round function called Thin Sponge. We give a framework to cons...
Simplifying Game-Based Definitions: Indistinguishability up to Correctness and Its Application to Stateful AE
indistinguishability oracle silencing provable security
2018/6/5
Often the simplest way of specifying game-based cryptographic definitions is apparently barred because the adversary would have some trivial win. Disallowing or invalidating these wins can lead to com...
Onion-AE: Foundations of Nested Encryption
Anonymity authenticated encryption onion routing
2018/2/6
Nested symmetric encryption is a well-known technique for low-latency communication privacy. But just what problem does this technique aim to solve? In answer, we provide a provable-security treatment...
Message-Recovery MACs and Verification-Unskippable AE
message recovery MACs authenticated encryption unskippability
2017/3/27
This paper explores a new type of MACs called message-recovery MACs (MRMACs). MRMACs have an additional input RR that gets recovered upon verification. Receivers must execute verification in order to ...
Rogue Decryption Failures: Reconciling AE Robustness Notions
provable security authenticated encryption multiple errors
2015/12/23
An authenticated encryption scheme is deemed secure (AE)
if ciphertexts both look like random bitstrings and are unforgeable. AE is
a much stronger notion than the traditional IND–CCA. One shortcomi...