CENCPP^: beyond-birthday-secure encryption from public permutations
From MaRDI portal
Publication:2672297
Recommendations
- BBB secure nonce based MAC using public permutations
- How to build pseudorandom functions from public random permutations
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- Beyond-birthday security for permutation-based Feistel networks
- Multi-user BBB security of public permutations based MAC
Cites work
- 3kf9: enhancing 3GPP-MAC beyond the birthday bound
- A new variant of PMAC: beyond the birthday bound
- Analysis of the single-permutation encrypted Davies-Meyer construction
- BBB secure nonce based MAC using public permutations
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Blockcipher-based MACs: beyond the birthday bound without message length
- Chaskey: an efficient MAC algorithm for 32-bit microcontrollers
- Duplexing the sponge: Single-pass authenticated encryption and other applications
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- How to build pseudorandom functions from public random permutations
- scientific article; zbMATH DE number 1942411 (Why is no real title available?)
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
- Information-theoretic indistinguishability via the chi-squared method
- Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- Minimalism in cryptography: the Even-Mansour scheme revisited
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
- Progress in Cryptology - INDOCRYPT 2004
- SPONGENT: The Design Space of Lightweight Cryptographic Hashing
- The PHOTON family of lightweight hash functions
- The software performance of authenticated-encryption modes
- The sum of CBC MACs is a secure PRF
- The summation-truncation hybrid: reusing discarded bits for free
- The “Coefficients H” Technique
- Tight security bounds for key-alternating ciphers
Cited in
(8)- BBB secure nonce based MAC using public permutations
- StriBob: аутентифицированное шифрование с помощью подстановки LPS из ГОСТ Р 34.11-2012
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Quantum attacks on PRFs based on public random permutations
- Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)
- Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
- Upper bound on information-theoretic security of permutation-based pseudorandom functions
This page was built for publication: \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672297)
