Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
From MaRDI portal
(Redirected from Publication:1633458)
Recommendations
- Tweakable blockciphers with asymptotically optimal security
- Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
- Tweakable Blockciphers with Beyond Birthday-Bound Security
- Optimally secure tweakable blockciphers
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
Cites work
- scientific article; zbMATH DE number 1670848 (Why is no real title available?)
- scientific article; zbMATH DE number 5485460 (Why is no real title available?)
- scientific article; zbMATH DE number 4039795 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 1754644 (Why is no real title available?)
- 3-query locally decodable codes of subexponential length
- A Greedy Heuristic for the Set-Covering Problem
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Breaking the circuit size barrier for secure computation under DDH
- Computationally private randomizing polynomials and their applications
- Distributed Point Functions and Their Applications
- Efficient and Secure Evaluation of Multivariate Polynomials and Applications
- Foundations of homomorphic secret sharing
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Fully homomorphic encryption using ideal lattices
- Function secret sharing
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Homomorphic secret sharing from Paillier encryption
- How to share a secret
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- On \(d\)-multiplicative secret sharing
- Probabilistic encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Simultaneous messages vs. communication
- Spooky Encryption and Its Applications
- Theory of Cryptography
Cited in
(24)- Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
- TNT: how to tweak a block cipher
- Tight security of cascaded LRW2
- Optimally secure tweakable blockciphers
- How to build fully secure tweakable blockciphers from classical blockciphers
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
- Tweakable Blockciphers with Beyond Birthday-Bound Security
- Tweakable blockciphers with asymptotically optimal security
- On the Security of Blockwise Secure Modes of Operation Beyond the Birthday Bound
- Optimally secure block ciphers from ideal primitives
- Offset-based BBB-secure tweakable block-ciphers with updatable caches
- Towards closing the security gap of Tweak-aNd-Tweak (TNT)
- Tweaking key-alternating Feistel block ciphers
- Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
- Insuperability of the standard versus ideal model gap for tweakable blockcipher security
- A modular framework for building variable-input-length tweakable ciphers
- A domain extender for the ideal cipher
- Minimizing the two-round tweakable Even-Mansour cipher
- Improved XKX-based AEAD scheme: removing the birthday terms
- Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- Salvaging weak security bounds for blockcipher-based constructions
- Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing
This page was built for publication: Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633458)
