Optimally Secure Block Ciphers from Ideal Primitives
From MaRDI portal
Publication:2795985
DOI10.1007/978-3-662-48800-3_18zbMath1382.94165OpenAlexW2294631369MaRDI QIDQ2795985
Publication date: 23 March 2016
Published in: Advances in Cryptology – ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48800-3_18
Related Items (14)
Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security ⋮ Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds ⋮ Connecting tweakable and multi-key blockcipher security ⋮ Multi-user security of the sum of truncated random permutations ⋮ Improved multi-user security using the squared-ratio method ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Better security-efficiency trade-offs in permutation-based two-party computation ⋮ On the adaptive security of MACs and PRFs ⋮ The Multi-user Security of Double Encryption ⋮ Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 ⋮ Better concrete security for half-gates garbling (in the multi-instance setting)
This page was built for publication: Optimally Secure Block Ciphers from Ideal Primitives
