How to make the Cramer-Shoup cryptosystem secure against linear related-key attacks
From MaRDI portal
Recommendations
- Public Key Encryption against Related Key Attacks
- RKA secure PKE based on the DDH and HR assumptions
- Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
- Related key secure PKE from hash proof systems
- Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks
Cites work
- A New Randomness Extraction Paradigm for Hybrid Encryption
- A Related-Key Rectangle Attack on the Full KASUMI
- A Unified Approach to Related-Key Attacks
- Continuous non-malleable key derivation and its application to related-key security
- Cryptography secure against related-key attacks and tampering
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Distinguisher and Related-Key Attack on the Full AES-256
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
- Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 2085203 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- Improved Related-Key Impossible Differential Attacks on Reduced-Round AES-192
- New types of cryptanalytic attacks using related keys
- Non-malleable functions and their applications
- Pseudorandom functions and permutations provably secure against related-key attacks
- Public Key Encryption against Related Key Attacks
- Related key secure PKE from hash proof systems
- Related-Key Cryptanalysis of the Full AES-192 and AES-256
- Related-key security for pseudorandom functions beyond the linear barrier
- RKA secure PKE based on the DDH and HR assumptions
- RKA security beyond the linear barrier: IBE, encryption and signatures
- Tamper detection and continuous non-malleable codes
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: How to make the Cramer-Shoup cryptosystem secure against linear related-key attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980852)