Cloud Computing, Security, Privacy in New Computing Environments. 7th International Conference, CloudComp 2016, and First International Conference, SPNCE 2016, Guangzhou, China, November 25–26, and December 15–16, 2016, Proceedings

Research Article

Secure Searchable Public-Key Encryption for Cloud Storage

  • @INPROCEEDINGS{10.1007/978-3-319-69605-8_17,
        author={Run Xie and Changlian He and Yu He and Chunxiang Xu and Kun Liu},
        title={Secure Searchable Public-Key Encryption for Cloud Storage},
        proceedings={Cloud Computing, Security, Privacy in New Computing Environments. 7th International Conference, CloudComp 2016, and First International Conference, SPNCE 2016, Guangzhou, China, November 25--26, and December 15--16, 2016, Proceedings},
        proceedings_a={CLOUDCOMP},
        year={2017},
        month={11},
        keywords={Searchable encryption Trapdoor indistinguishability Keywords guessing attacks Cloud storage Security analysis},
        doi={10.1007/978-3-319-69605-8_17}
    }
    
  • Run Xie
    Changlian He
    Yu He
    Chunxiang Xu
    Kun Liu
    Year: 2017
    Secure Searchable Public-Key Encryption for Cloud Storage
    CLOUDCOMP
    Springer
    DOI: 10.1007/978-3-319-69605-8_17
Run Xie1,*, Changlian He1, Yu He2, Chunxiang Xu2, Kun Liu3
  • 1: Yibin University
  • 2: University of Electronic Science and Technology of China
  • 3: Guangzhou University
*Contact email: xrryun@126.com

Abstract

With networking became prevalent, the amount of data to be stored and managed on networked servers rapidly increases. Meanwhile, with the improvement of awareness of data privacy, the user’s sensitive data is usually encrypted before uploading them to the cloud server. The searchable public-key encryption provides an efficient mechanism to achieve data retrieval in encrypted storage. Therefore, it is a critical technique on promoting secure and efficient cloud storage. Unfortunately, only few the existing schemes are secure to resist outside keyword guessing attacks. In this paper, we propose two efficient searchable public-key encryption schemes with a designated tester (dPEKS). One is a basic dPEKS, where the dPEKS ciphertext indistinguishability is proved without the random oracle. Meanwhile, the basic scheme is secure to resist the outside KGA since it satisfies the property of trapdoor indistinguishability. Comparing with the existing dPEKS schemes which use expensive pairing computation, our scheme is more efficient since we only need multi-exponentiation. Another is an enhanced dPEKS scheme. With the sender’s identity is kept secret from server, this scheme can provide stronger security.