\(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
From MaRDI portal
Publication:2672297
DOI10.1007/S10623-022-01045-ZzbMath1495.94044OpenAlexW4281482802WikidataQ114849749 ScholiaQ114849749MaRDI QIDQ2672297
Avijit Dutta, Eik List, Arghya Bhattacharjee, Mridul Nandi
Publication date: 8 June 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01045-z
Related Items (2)
Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ Quantum attacks on PRFs based on public random permutations
Uses Software
Cites Work
- Unnamed Item
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- Information-theoretic indistinguishability via the chi-squared method
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Blockcipher-based MACs: beyond the birthday bound without message length
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- The summation-truncation hybrid: reusing discarded bits for free
- How to build pseudorandom functions from public random permutations
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
- Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited
- The Software Performance of Authenticated-Encryption Modes
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- The “Coefficients H” Technique
- 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
- BBB Secure Nonce Based MAC Using Public Permutations
- The Sum of CBC MACs Is a Secure PRF
- The PHOTON Family of Lightweight Hash Functions
- A New Variant of PMAC: Beyond the Birthday Bound
- SPONGENT: The Design Space of Lightweight Cryptographic Hashing
- Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
- Tight Security Bounds for Key-Alternating Ciphers
- Progress in Cryptology - INDOCRYPT 2004
This page was built for publication: \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
