计算机工程与应用 ›› 2017, Vol. 53 ›› Issue (12): 116-120.DOI: 10.3778/j.issn.1002-8331.1609-0212

• 网络、通信与安全 • 上一篇    下一篇

基于DCR假设的KDM-CCA安全性

郭  伟1,常金勇1,2,高  磊1   

  1. 1.长治学院 数学系,山西 长治 046011
    2.北京大学 数学科学学院,北京 100871
  • 出版日期:2017-06-15 发布日期:2017-07-04

KDM-CCA security based on DCR assumption

GUO Wei1, CHANG Jinyong1,2, GAO Lei1   

  1. 1.Department of Mathematics, Changzhi University, Changzhi, Shanxi 046011, China
    2.School of Mathematics, Peking University, Beijing 100871, China
  • Online:2017-06-15 Published:2017-07-04

摘要: 加密方案的KDM(Key-Dependent Message)安全性定义依赖于某一特定的函数族[F]。通过引入一类新的函数族,证明了在两个用户的情形下,Cramer和Shoup提出了基于DCR(Decisional Composite Residuosity)假设的方案(以下称为CS-DCR方案),关于这类新函数族具有KDM-CCA安全性。由于CS-DCR方案本身非常得高效,因此,获得了兼有高效性和(相应)KDM-CCA安全性的加密方案。

关键词: DCR假设, KDM安全性, CCA安全性, 公钥加密, Cramer-Shoup方案

Abstract: The definition of KDM (Key-Dependent Message) security is related to some specific ensemble[F]. By introducing a new ensemble of functions, it proves that, in two user cases, the DCR-based scheme proposed by Cramer and Shoup is KDM-CCA secure w.r.t. the new ensemble. Since the CS-DCR scheme is very efficient, an encryption scheme is gotten which is not only somewhat KDM-CCA secure but also very efficient.

Key words: Decisional Composite Residuosity(DCR) assumption, Key-Dependent Message(KDM) security, Chosen Ciphertext Attack(CCA) security, public key encryption, Cramer-Shoup scheme