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_11zbMATH Open1446.94148OpenAlexW2892585385MaRDI QIDQ1633458FDOQ1633458
Authors: Jooyoung Lee, B. H. Lee 
Publication date: 20 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03326-2_11
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
- Probabilistic encryption
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Theory of Cryptography
- A Greedy Heuristic for the Set-Covering Problem
- How to share a secret
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Computationally private randomizing polynomials and their applications
- 3-query locally decodable codes of subexponential length
- On \(d\)-multiplicative secret sharing
- Title not available (Why is that?)
- Simultaneous messages vs. communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Homomorphic secret sharing from Paillier encryption
- Spooky Encryption and Its Applications
- Breaking the circuit size barrier for secure computation under DDH
- Function secret sharing
- Foundations of homomorphic secret sharing
- Title not available (Why is that?)
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Efficient and Secure Evaluation of Multivariate Polynomials and Applications
- Distributed Point Functions and Their Applications
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
- Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
- Improved XKX-based AEAD scheme: removing the birthday terms
- 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)
