Advances in Cryptology - CRYPTO 2003

From MaRDI portal
Revision as of 02:46, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5428137

DOI10.1007/B11817zbMath1122.94374OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428137

Shai Halevi, Phillip Rogaway

Publication date: 28 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11817




Related Items (40)

Another Look at TightnessAutomated proofs of block cipher modes of operationFormat Preserving Sets: On Diffusion Layers of Format Preserving Encryption SchemesAn extension of Cook’s elasti cipherWeak-Key and Related-Key Analysis of Hash-Counter-Hash Tweakable Enciphering SchemesA new multi-linear universal hash familyOn-line ciphers and the Hash-CBC constructionsAnother look at XCBSimpira v2: A Family of Efficient Permutations Using the AES Round FunctionHow to Build Fully Secure Tweakable Blockciphers from Classical BlockciphersA modular approach to the incompressibility of block-cipher-based AEADsDesigning tweakable enciphering schemes using public permutationsImplicit key-stretching security of encryption schemesTweakable enciphering schemes using only the encryption function of a block cipherMinimizing the two-round tweakable Even-Mansour cipherAn Improved Security Bound for HCTRTweakable block ciphersHow to Build a Hash Function from Any Collision-Resistant FunctionTweaking key-alternating Feistel block ciphersOn the optimality of non-linear computations for symmetric key primitivesNotions and relations for RKA-secure permutation and function familiesBuilding blockcipher from small-block tweakable blockcipherA general mixing strategy for the ECB-Mix-ECB mode of operationA Provable-Security Treatment of the Key-Wrap ProblemEfficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman AssumptionTweakable Enciphering Schemes from Hash-Sum-ExpansionThe Twin Diffie-Hellman Problem and ApplicationsOn Shortening Ciphertexts: New Constructions for Compact Public Key and Stateful Encryption SchemesTweaking a block cipher: multi-user beyond-birthday-bound security in the standard modelBreaking tweakable enciphering schemes using Simon's algorithmEfficient public key encryption with smallest ciphertext expansion from factoringAuthenticated Encryption with Small Stretch (or, How to Accelerate AERO)Linicrypt: A Model for Practical Cryptography\textsf{FAST}: disk encryption and beyondBuilding Blockcipher from Tweakable Blockcipher: Extending FSE 2009 ProposalDirect chosen-ciphertext secure identity-based key encapsulation without random oraclesThe twin Diffie-Hellman problem and applicationsA Domain Extender for the Ideal CipherTweakable Pseudorandom Permutation from Generalized Feistel StructureSecurity Notions for Disk Encryption







This page was built for publication: Advances in Cryptology - CRYPTO 2003