Skip to main content
SpringerLink
Log in

Dynamic Verifiable Encrypted Keyword Search

Using Bitmap Index

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

Outsourcing data storage to the cloud securely and retrieving the remote data in an efficient way is a very significant research topic, with high relevance to secure cloud deployment. With the ever growing security and privacy concerns, encrypting the data stored remotely is inevitable but using traditional encryption thwarts performing search operation on the encrypted data. Encrypted keyword search is a cryptographic setting, which offers search functionality and at the same time, ensures security and privacy of the remotely stored secured data. Searchable Symmetric Encryption (SSE) is a technique to securely outsource the data, which is encrypted using symmetric key primitives, while maintaining search functionality. In this paper, we consider Searchable Symmetric Encryption (SSE) in the presence of a Semi-Honest-But-Curious Cloud Service Provider (SHBC-CSP) and, defined a new security notion for SSE in presence of SHBC-CSP, contrived two new SSE schemes and proved their security formally in the proposed security notion. The dynamic verifiable encrypted keyword search proposed in this paper is the first SSE scheme to the best of our knowledge, which is both dynamic and verifiable. As an initial step, we have designed a verifiable encrypted keyword search solution and later, we have extended the research to make it both dynamic and verifiable. Also, we compare the performance metrics of our schemes with other existing schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6

Similar content being viewed by others

References

  1. Song, D. X. et al. (2000). Practical techniques for searches on encrypted data. IEEE Symposium on Security and Privacy, 44–55.

  2. Curtmola, R et al. (2006). Searchable symmetric encryption: improved definitions and efficient constructions. In Proceedings of the 13th ACM conference on computer and communications security, CCS 2006 (pp. 79–88).

  3. Kamara, S et al. (2012). Dynamic searchable symmetric encryption. ACM Conference on Computer and Communications Security, 965–976.

  4. Hwang, Y H et al. (2013). Encrypted keyword search with cryptographically constant overheads. Samsung Best Paper Award.

  5. Hwang, Y H et al. (2014). Encrypted keyword search mechanism based on bitmap index for personal storage services. In 13th IEEE international conference on trust, security and privacy in computing and communications (pp. 140–147).

  6. Wang, C et al. (2012). Enabling secure and efficient ranked keyword search over outsourced cloud data. IEEE Transactions on Parallel and Distributed Systems, 1467–1479.

  7. Zheng, Q et al. (2014). VABKS: verifiable attribute-based keyword search over outsourced encrypted data. IEEE Conference on Computer Communications, 522–530.

  8. Qiu, M. (2013). Security-aware optimization for ubiquitous computing systems with SEAT graph approach. Journal of Computer and System Sciences, 518–529.

  9. Qiu, M. (2016). Proactive user-centric secure data scheme using attribute-based semantic access controls for mobile clouds in financial industry. Future Generation Computer Systems.

  10. Chai, Q et al. (2012). Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In Proceedings of IEEE international conference on communications ICC (pp. 917–922).

  11. Kamara, S. (2015). Encrypted search. ACM Crossroads, 30–34.

  12. Kamara, S et al. (2013). Parallel and dynamic searchable symmetric encryption, financial cryptography and data security. In 17th International conference, fc 2013 (pp. 258–274).

  13. Chang, Y.-C. et al. (2004). Privacy preserving keyword searches on remote encrypted data. IACR Cryptology ePrint Archive, 51.

  14. Goh, E.-J. (2003). Secure Indexes, IACR Cryptology ePrint Archive 216.

  15. Bösch, C et al. (2014). A survey of provably secure searchable encryption. ACM Computing Surveys, 18, 1–18:51.

    Article  Google Scholar 

  16. Paillier, P. (1999). Public-key cryptosystems based on composite degree residuosity classes. Advances in Cryptology - EUROCRYPT, 223–238.

Download references

Author information

Authors and Affiliations

  1. Technical Architect at ICU Medical, Chennai, India

    S. Sree Vivek

  2. Samsung Research and Development Institute, Bangalore, India

    Rajkumar Ramasamy & Praveen George

  3. Department of Information Sciences and Technologies, Pennsylvania State University, State College, PA, USA

    Bharat S. Rawal Kshatriya

Authors
  1. S. Sree Vivek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajkumar Ramasamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Praveen George
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bharat S. Rawal Kshatriya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Sree Vivek.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vivek, S., Ramasamy, R., George, P. et al. Dynamic Verifiable Encrypted Keyword Search. J Sign Process Syst 90, 1151–1165 (2018). https://doi.org/10.1007/s11265-017-1299-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-017-1299-6

Keywords

Search

Navigation