The “Coefficients H” Technique

DOI10.1007/978-3-642-04159-4_21zbMath1256.94060OpenAlexW1498886746MaRDI QIDQ3644210

Publication date: 3 November 2009

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04159-4_21

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (73)

On tight quantum security of HMAC and NMAC in the quantum random oracle model ⋮ The key-dependent message security of key-alternating Feistel ciphers ⋮ Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ On the resilience of Even-Mansour to invariant permutations ⋮ (Quantum) cryptanalysis of misty schemes ⋮ Nonce-misuse security of the SAEF authenticated encryption mode ⋮ Towards tight security of cascaded LRW2 ⋮ Tweaking Even-Mansour Ciphers ⋮ Multi-key Security: The Even-Mansour Construction Revisited ⋮ The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC ⋮ Tweak-Length Extension for Tweakable Blockciphers ⋮ Random oracles and non-uniformity ⋮ Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method ⋮ Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds ⋮ \textsf{Light-OCB}: parallel lightweight authenticated cipher with full security ⋮ Revisiting structure graphs: applications to CBC-MAC and EMAC ⋮ Beyond-birthday security for permutation-based Feistel networks ⋮ Mirror theory and cryptography ⋮ Format-Preserving Encryption Algorithms Using Families of Tweakable Blockciphers ⋮ \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Multi-user security bound for filter permutators in the random oracle model ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication ⋮ Secret can be public: low-memory AEAD mode for high-order masking ⋮ Block-cipher-based tree hashing ⋮ Adaptively code-correlation robustness functions and its applications to private set intersection ⋮ Key-reduced variants of 3Kf9 with beyond-birthday-bound security ⋮ Jammin' on the deck ⋮ Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC} ⋮ A modular approach to the security analysis of two-permutation constructions ⋮ Improved multi-user security using the squared-ratio method ⋮ Better security-efficiency trade-offs in permutation-based two-party computation ⋮ Tight security for key-alternating ciphers with correlated sub-keys ⋮ Fine-tuning the ISO/IEC standard \textsf{LightMAC} ⋮ Categorization of faulty nonce misuse resistant message authentication ⋮ Revisiting the security of \textsf{COMET} authenticated encryption scheme ⋮ \textsf{tHyENA}: making \textsf{HyENA} even smaller ⋮ On the Efficiency of ZMAC-Type Modes ⋮ Provable security of HADES structure ⋮ Provably secure reflection ciphers ⋮ Designing tweakable enciphering schemes using public permutations ⋮ INT-RUP security of \textsf{SAEB} and \textsf{TinyJAMBU} ⋮ Offset-based BBB-secure tweakable block-ciphers with updatable caches ⋮ \textsf{ISAP+}: \textsf{ISAP} with fast authentication ⋮ Provable security against generic attacks on stream ciphers ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Output masking of tweakable Even-Mansour can be eliminated for message authentication code ⋮ A robust and sponge-like PRNG with improved efficiency ⋮ Towards closing the security gap of Tweak-aNd-Tweak (TNT) ⋮ Minimizing the two-round tweakable Even-Mansour cipher ⋮ Tight security analysis of 3-round key-alternating cipher with a single permutation ⋮ How to build optimally secure PRFs using block ciphers ⋮ Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher ⋮ Tweaking key-alternating Feistel block ciphers ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff ⋮ New Bounds for Keyed Sponges with Extendable Output: Independence Between Capacity and Message Length ⋮ A note on the chi-square method: a tool for proving cryptographic security ⋮ Minimizing the two-round Even-Mansour cipher ⋮ The Multi-user Security of Double Encryption ⋮ On the XOR of Multiple Random Permutations ⋮ The Oribatida v1.3 family of lightweight authenticated encryption schemes ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction ⋮ Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ Provable related-key security of contracting Feistel networks ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security ⋮ Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC ⋮ Multi-user BBB security of public permutations based MAC ⋮ Security analysis of NIST CTR-DRBG ⋮ Better concrete security for half-gates garbling (in the multi-instance setting)

Cites Work

This page was built for publication: The “Coefficients H” Technique