Efficient searchable public key encryption against keyword guessing attacks for cloud-based EMR systems

被引:27
作者
Lu, Yang [1 ]
Li, Jiguo [2 ]
机构
[1] Nanjing Normal Univ, Sch Comp Sci & Technol, Nanjing, Jiangsu, Peoples R China
[2] Fujian Normal Univ, Coll Math & Informat, Fuzhou, Fujian, Peoples R China
来源
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS | 2019年 / 22卷 / 01期
基金
中国国家自然科学基金;
关键词
IDENTITY-BASED ENCRYPTION; PROXY RE-ENCRYPTION; DESIGNATED TESTER; SECURE; SCHEMES; SERVER;
D O I
10.1007/s10586-018-2855-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Due to the tremendous benefits of cloud computing, an increasing number of health care providers tend to deploy the electronic medical record (EMR) storages and application services into cloud. To protect patients' privacy, sensitive EMRs have to be encrypted before being uploaded to cloud. This makes effective utilization of EMRs, such as plaintext keyword search, a very challenging problem. Public key encryption with keyword search (PEKS) provides a promising cryptographic solution to encrypted EMR data retrieval, because it allows one to delegate to an untrusted storage server the capability of searching on publicly encrypted EMR data without compromising the security of original EMR data. Recently, two secure channel free PEKS schemes were proposed for cloud-based EMR systems. However, our cryptanalysis demonstrates that both of these two schemes suffer from the security vulnerabilities caused by the keyword guessing attack. To deal with this problem, a novel secure channel free PEKS scheme is developed in this paper. The proposed scheme not only provides the resistance to the existing known three types of keyword guessing attacks, but also has the merit of no designated server. In the standard model, it is formally proven to achieve both the keyword ciphertext indistinguishability and the trapdoor indistinguishability under the adaptive chosen-keyword attacks. The comparisons indicate that the scheme is secure and practicable.
引用
收藏
页码:285 / 299
页数:15
相关论文
共 59 条
  • [1] Abdalla M, 2005, LECT NOTES COMPUT SC, V3621, P205
  • [2] Abdalla M, 2001, LECT NOTES COMPUT SC, V2020, P143
  • [3] [Anonymous], 2016, HDB RES MODERN CRYPT
  • [4] [Anonymous], 2013, PBC library: the pairing-based cryptography library
  • [5] Ateniese G., 2006, ACM Transactions on Information and Systems Security, V9, P1, DOI 10.1145/1127345.1127346
  • [6] SSARES: Secure searchable automated remote email storage
    Aviv, Adam J.
    Locasto, Michael E.
    Potter, Shaya
    Keromytis, Angelos D.
    [J]. TWENTY-THIRD ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE, PROCEEDINGS, 2007, : 129 - +
  • [7] Baek J, 2008, PUBLIC KEY ENCRYPTIO, V2005, P1249
  • [8] Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
  • [9] Boneh D., 2001, Advances in Cryptology - CRTPTO 2001. 21st Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science Vol.2139), P213
  • [10] Byun JW, 2006, LECT NOTES COMPUT SC, V4165, P75