Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
From MaRDI portal
Publication:1633458
DOI10.1007/978-3-030-03326-2_11zbMath1446.94148OpenAlexW2892585385MaRDI QIDQ1633458
Publication date: 20 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03326-2_11
Related Items (6)
Tight security of cascaded LRW2 ⋮ Towards closing the security gap of Tweak-aNd-Tweak (TNT) ⋮ Minimizing the two-round tweakable Even-Mansour cipher ⋮ Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher ⋮ Tweaking key-alternating Feistel block ciphers ⋮ TNT: how to tweak a block cipher
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(d\)-multiplicative secret sharing
- Probabilistic encryption
- Homomorphic secret sharing from Paillier encryption
- Computationally private randomizing polynomials and their applications
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
- Spooky Encryption and Its Applications
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Function Secret Sharing
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- How to share a secret
- Efficient and Secure Evaluation of Multivariate Polynomials and Applications
- A Greedy Heuristic for the Set-Covering Problem
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Simultaneous messages vs. communication
- Foundations of Homomorphic Secret Sharing
- 3-query locally decodable codes of subexponential length
- Fully homomorphic encryption using ideal lattices
- Distributed Point Functions and Their Applications
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Theory of Cryptography
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
This page was built for publication: Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
