Ciphers secure against related-key attacks
From MaRDI portal
Recommendations
- On related-secret pseudorandomness
- A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications
- Improved constructions of PRFs secure against related-key attacks
- The related-key analysis of Feistel constructions
- Pseudorandom functions and permutations provably secure against related-key attacks
Cited in
(31)- Subversion-resilient signatures: definitions, constructions and applications
- Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle
- Non-malleable functions and their applications
- Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
- Connecting tweakable and multi-key blockcipher security
- Critique of the related-key attack concept
- Relations between robustness and RKA security under public-key encryption
- Clever arbiters versus malicious adversaries. On the gap between known-input security and chosen-input security
- Public Key Encryption against Related Key Attacks
- Secure message authentication against related-key attack
- The related-key analysis of Feistel constructions
- The Related-Key Security of Iterated Even–Mansour Ciphers
- The Chaining Lemma and its application
- Efficient public-key cryptography with bounded leakage and tamper resilience
- On cipher-dependent related-key attacks in the ideal-cipher model
- Expedient Non-malleability Notions for Hash Functions
- Related-Key Cryptanalysis of Midori
- On related-secret pseudorandomness
- Delayed-key message authentication for streams
- Security Against Related Randomness Attacks via Reconstructive Extractors
- On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers
- A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications
- On the security of CS-cipher
- Bounded tamper resilience: how to go beyond the algebraic barrier
- Notions and relations for RKA-secure permutation and function families
- Information Security
- Non-malleable Codes with Split-State Refresh
- Functional encryption: deterministic to randomized functions from simple assumptions
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Related-cipher attacks: applications to Ballet and ANT
This page was built for publication: Ciphers secure against related-key attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713918)