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

Key-dependent message （KDM） security is an important security issue that has attracted much research in recent years. In this paper, we present a new construction of the symmetric encryption scheme in the the ideal cipher model （ICM）; we prove that our scheme is KDM secure against active attacks wit...

Full description

Saved in:
Bibliographic Details
Published inFrontiers of Computer Science Vol. 8; no. 3; pp. 469 - 477
Main Authors LAI, Qiqi, CHEN, Yuan, HU, Yupu, WANG, Baocang, JIANG, Mingming
Format Journal Article
LanguageEnglish
Published Heidelberg Higher Education Press 01.06.2014
Springer Nature B.V
Subjects
Algorithms
challenge function
Computer Science
Cryptography
Encryption
ideal cipher model
key-dependent message
Messages
Security
symmetric encryption
universal hash function
主动攻击
加密方案
安全性
安全问题
密码
对称加密
消息
理想
key-dependent message
challenge function
universal hash function
ideal cipher model
symmetric encryption
Online AccessGet full text

Cover

More Information
Summary:Key-dependent message （KDM） security is an important security issue that has attracted much research in recent years. In this paper, we present a new construction of the symmetric encryption scheme in the the ideal cipher model （ICM）; we prove that our scheme is KDM secure against active attacks with respect to arbitrary polynomialtime challenge functions. Our main idea is to introduce a universal hash function （UHF） h as a random value for each encrypfion, and then use s = h（sk） as the key of the ideal cipher F, where sk is the private key of our symmetric encryption scheme. Although many other schemes that are secure against KDM attacks have already been proposed, in both the ideal standard models, the much more significance of our paper is the simplicity in which we implement KDM security against active attacks.
Bibliography:symmetric encryption, key-dependent message,challenge function, universal hash function, ideal cipher model
11-5731/TP
Key-dependent message （KDM） security is an important security issue that has attracted much research in recent years. In this paper, we present a new construction of the symmetric encryption scheme in the the ideal cipher model （ICM）; we prove that our scheme is KDM secure against active attacks with respect to arbitrary polynomialtime challenge functions. Our main idea is to introduce a universal hash function （UHF） h as a random value for each encrypfion, and then use s = h（sk） as the key of the ideal cipher F, where sk is the private key of our symmetric encryption scheme. Although many other schemes that are secure against KDM attacks have already been proposed, in both the ideal standard models, the much more significance of our paper is the simplicity in which we implement KDM security against active attacks.
key-dependent message
challenge function
ideal cipher model
universal hash function
symmetric encryption
Document received on :2013-06-07
Document accepted on :2013-12-20
ISSN:2095-2228
2095-2236
DOI:10.1007/s11704-014-3062-5