Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model

DOI10.1007/S11704-014-3062-5zbMath1368.94108OpenAlexW2004541138WikidataQ121902413 ScholiaQ121902413MaRDI QIDQ893865

Baocang Wang, Qiqi Lai, Yuan Chen, Mingming Jiang, Yu Pu Hu

Publication date: 20 November 2015

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-014-3062-5

zbMATH Keywords

ideal cipher modelsymmetric encryptionuniversal hash functionkey-dependent messagechallenge function

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probabilistic encryption
• Universal classes of hash functions
• Black-Box Circular-Secure Encryption beyond Affine Functions
• Key-Dependent Message Security: Generic Amplification and Completeness
• The random oracle methodology, revisited
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Bounded Key-Dependent Message Security
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• Circular-Secure Encryption from Decision Diffie-Hellman
• On the (Im)Possibility of Key Dependent Encryption
• The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Communication Theory of Secrecy Systems*
• The equivalence of the random oracle model and the ideal cipher model, revisited
• Towards Key-Dependent Message Security in the Standard Model
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model