搜索结果: 1-15 共查到“密码学 Birthday”相关记录45条 . 查询时间(0.078 秒)
We show that Legendre PRF, recently suggested as an MPC-friendly primitive in a prime field ZpZp, admits key recovery attacks of complexity O(p√)O(p) rather than previously assumed O(p)O(p). We also d...
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound
authentication provable security permutation
2019/4/28
The combination of universal hashing and encryption is a fundamental paradigm for the construction of symmetric-key MACs, dating back to the seminal works by Wegman and Carter, Shoup, and Bernstein. W...
Beyond Birthday Bound Secure MAC in Faulty Nonce Model
Graceful Security Faulty Nonce Mirror Theory
2019/2/27
Encrypt-then-MAC (EtM) is a popular mode for authenticated encryption (AE). Unfortunately, almost all designs following the EtM paradigm, including the AE suites for TLS, are vulnerable against nonce ...
An Algorithmic Framework for the Generalized Birthday Problem
Algorithmic Framework Generalized Birthday Problem
2018/6/7
Our results are obtained using a framework that combines several algorithmic techniques such as variants of the Schroeppel-Shamir algorithm for solving knapsack problems (devised in works by Howgrave-...
Generic Attacks against Beyond-Birthday-Bound MACs
Modes of operation Cryptanalysis Message Authentication Codes
2018/6/5
In this work, we study the security of several recent MAC constructions with provable security beyond the birthday bound. We consider block-cipher based constructions with a double-block internal stat...
Wide Tweakable Block Ciphers Based on Substitution-Permutation Networks: Security Beyond the Birthday Bound
substitution-permutation networks tweakable block ciphers domain extension of block ciphers
2018/5/28
Substitution-Permutation Networks (SPNs) refer to a family of constructions which build a wnwn-bit (tweakable) block cipher from nn-bit public permutations. Many widely deployed block ciphers are part...
Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC
EDMEDM EWCDMEWCDM Mirror Theory
2018/5/28
The international standard ISO/IEC 9797-1:2011 specifies six versions of MACs, called MAC Algorithm 1-6, and many of these MACs enjoy widespread use in practical applications. However, security guaran...
Blockcipher-based MACs: Beyond the Birthday Bound without Message Length
MAC, blockcipher, PRF
2017/9/13
We present blockcipher-based MACs (Message Authentication Codes) that have beyond the birthday bound security without message length in the sense of PRF (Pseudo-Random Function) security. Achieving su...
Universal Forgery with Birthday Paradox: Application to Blockcipher-based Message Authentication Codes and Authenticated Encryptions
Universal forgery birthday attack CBC-MAC
2017/7/6
We also propose another some generic universal forgery attacks using collision finding with structural input messages, by birthday paradox in the classic setting. Since our attacks are based on the co...
In CRYPTO 2017, Mennink and Neves showed almost n-bit security for a dual version of EWCDM. In this paper we describe a birthday attack on this construction which violates their claim.
Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security
Blockcipher tweakable blockcipher efficient authenticated encryption
2017/5/31
Modular design via a tweakable blockcipher (TBC) offers efficient authenticated encryption (AE) schemes (with associated data) that call a blockcipher once for each data block (of associated data or a...
Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption
message authentication codes authenticated encryption provable security
2016/12/29
This paper proposes an authenticated encryption scheme, called SIVx, that preserves BBB security also in the case of unlimited nonce reuses. For this purpose, we propose a single-key BBB-secure messag...
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
Wegman-Carter MAC Davies-Meyer construction nonce-misuse resistance
2016/5/30
We propose a nonce-based MAC construction called EWCDM (Encrypted Wegman-Carter with Davies-Meyer), based on an almost xor-universal hash function and a block cipher, with the following properties: (i...
Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch
deterministic authenticated encryption symmetric cryptography cryptographic schemes
2016/4/22
Block-cipher-based authenticated encryption has obtained considerable attention from the ongoing CAESAR competition. While the focus of CAESAR resides primarily on nonce-based authenticated encryption...