Analysis of the single-permutation encrypted Davies-Meyer construction
type: Item
instance of: scholarly article
title: Analysis of the single-permutation encrypted Davies-Meyer construction
zbMATH Open document ID: 1442.94035
author: Benoît Cogliati
author: Yannick Seurin
published in: Designs, Codes and Cryptography
publication date: 2018-10-26T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6966438
zbMATH Keywords: block cipher
zbMATH Keywords: pseudorandomness
zbMATH Keywords: PRP-to-PRF conversion
zbMATH Keywords: beyond-birthday-bound security
Wikidata QID: Q122654826
MaRDI profile type: Publication
full work available at URL: s10623-018-0470-9
OpenAlex ID: W2790044991
cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
cites work: Q4249643
cites work: Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
cites work: A note on the chi-square method: a tool for proving cryptographic security
cites work: Tight Security Bounds for Key-Alternating Ciphers
cites work: Minimizing the Two-Round Even-Mansour Cipher
cites work: EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
cites work: The Indistinguishability of the XOR of $$k$$ Permutations
cites work: Information-theoretic indistinguishability via the chi-squared method
cites work: Q4249345
cites work: Q3374930
cites work: Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations
cites work: Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
cites work: On the XOR of Multiple Random Permutations
cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions
cites work: Probability and Computing
cites work: The Iterated Random Permutation Problem with Applications to Cascade Encryption
cites work: Q4950452
cites work: A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
cites work: The “Coefficients H” Technique
cites work: How many queries are needed to distinguish a truncated random permutation from a random function?
cites work: On Fast and Provably Secure Message Authentication Based on Universal Hashing
cites work: New hash functions and their use in authentication and set equality
DOI: 10.1007/S10623-018-0470-9
description: scientific article; zbMATH DE number 6966438