Beyond-birthday secure domain-preserving PRFs from a single permutation
From MaRDI portal
Publication:2416937
DOI10.1007/s10623-018-0528-8zbMath1445.94020OpenAlexW2885790668WikidataQ122872570 ScholiaQ122872570MaRDI QIDQ2416937
Yaobin Shen, Chun Guo, Lei Wang, Da-Wu Gu
Publication date: 24 May 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0528-8
beyond birthday boundPRP-to-PRFbuilding pseudorandom functions (PRFs) from pseudorandom permutations (PRPs)domain preserving
Related Items (2)
\(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
- Information-theoretic indistinguishability via the chi-squared method
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Analysis of the single-permutation encrypted Davies-Meyer construction
- The advantage of truncated permutations
- On the XOR of Multiple Random Permutations
- Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
- Minimizing the Two-Round Even-Mansour Cipher
- Hash Functions Based on Three Permutations: A Generic Security Analysis
- The Indistinguishability of the XOR of $$k$$ Permutations
- Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- PRESENT: An Ultra-Lightweight Block Cipher
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The “Coefficients H” Technique
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
- Advances in Cryptology – CRYPTO 2004
- Tight Security Bounds for Key-Alternating Ciphers
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Theory of Cryptography
- The security of the cipher block chaining message authentication code
This page was built for publication: Beyond-birthday secure domain-preserving PRFs from a single permutation
