Randomness-dependent message security

DOI10.1007/978-3-642-36594-2_39MaRDI QIDQ4910306zbMATH OpenOpenAlexFDO

Authors Eleanor Birrell, Kai-Min Chung, Rafael Pass, Sidharth Telang

Publication date 18 March 2013

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36594-2_39

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1951605
• Towards Key-Dependent Message Security in the Standard Model
• On the (Im)Possibility of Key Dependent Encryption
• Encryption schemes secure under related-key and key-dependent message attacks
• Bounded key-dependent message security

Cited in

(8)

• A fast method for complete randomization of messages.
• Reproducible circularly secure bit encryption: applications and realizations
• Related randomness security for public key encryption, revisited
• Reproducible circularly-secure bit encryption: applications and realizations
• On the (Im)Possibility of Key Dependent Encryption
• Randomness Re-use in Multi-recipient Encryption Schemeas
• CCA security and trapdoor functions via key-dependent-message security
• Beyond Uber: instantiating generic groups via PGGs

This page was built for publication: Randomness-dependent message security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910306)