Dynamic Searchable Symmetric Encryption Technique for Secure Cloud Storage

Authors

  • Mallem Anusha MCA student, Department of Computer Science, KMM Institute of Post-Graduation Studies, Tirupati, Tirupati(dt), Andhra Pradesh, India Author
  • DR. K. Venkataramana Professor, Department of Computer Science, KMM Institute of Post-graduation Studies, Tirupati, Tirupati(D.t), Andhra Pradesh, India Author

Keywords:

DSSE, Doctor, Patient, Cloud Server, Trusted Authority, AES, Encryption, Decryption

Abstract

Dynamic Searchable Symmetric Encryption (DSSE) plays a crucial role in enabling secure keyword searches over encrypted data stored in the cloud. It allows users to outsource search functionality to cloud servers without exposing the underlying data. While many existing DSSE approaches emphasize strong security features such as forward security and Type-I-backward security to prevent data leakage, they often neglect resilience against unintended or faulty client actions—like repeated operations or attempts to delete entries that don’t exist—which can lead to inaccurate search results. To overcome these limitations, this paper introduces two enhanced DSSE models, named SR-DSSE a and SR-DSSE b. These schemes not only uphold forward and Type-I-backward security but also focus on improving robustness to ensure accurate search outcomes even when clients make errors. Leveraging AES encryption, the proposed methods are particularly suitable for securing sensitive data, such as medical records, and are demonstrated in healthcare environments involving interactions among patients, doctors, cloud providers, and trusted entities.

Downloads

Download data is not yet available.

References

C. Kamara, C. Papamanthou, and T. Roeder, "Dynamic searchable symmetric encryption," in *Proc. ACM Conf. Comput. Commun. Secur.*, Oct. 2012, pp. 965–976.

S. Lu, J. Zheng, Z. Cao, Y. Wang, and C. Gu, "A survey on cryptographic techniques for protecting big data security: Present and forthcoming," *Sci. China Inf. Sci.*, vol. 65, no. 10, pp. 1–34, Oct. 2022.

E. Stefanov, C. Papamanthou, and E. Shi, "Practical dynamic searchable encryption with small leakage," in *Proc. Netw. Distrib. Syst. Secur. Symp.*, 2014, pp. 1–15.

R. Bost, B. Minaud, and O. Ohrimenko, "Forward and backward private searchable encryption from constrained cryptographic primitives," in *Proc. ACM SIGSAC Conf. Comput. Commun. Secur.*, Oct. 2017, pp. 1465–1482.

C. Zuo, S. Sun, J. K. Liu, J. Shao, and J. Pieprzyk, "Dynamic searchable symmetric encryption with forward and stronger backward privacy," in *Proc. ESORICS*. Cham, Switzerland: Springer, 2019, pp. 283–303.

T. Hoang, A. A. Yavuz, and J. Guajardo, "A secure searchable encryption framework for privacy-critical cloud storage services," *IEEE Trans. Services Comput.*, vol. 14, no. 6, pp. 1675–1689, Nov. 2021.

J. G. Chamani, D. Papadopoulos, C. Papamanthou, and R. Jalili, "New constructions for forward and backward private symmetric searchable encryption," in *Proc. ACM SIGSAC Conf. Comput. Commun. Secur.*, Oct. 2018, pp. 1038–1055.

P. Xu et al., "ROSE: Robust searchable encryption with forward and backward security," *IEEE Trans. Inf. Forensics Security*, vol. 17, pp. 1115–1130, 2022.

C. Zuo, S. Sun, J. K. Liu, J. Shao, J. Pieprzyk, and G. Wei, "Forward and backward private dynamic searchable symmetric encryption for conjunctive queries," *IACR Cryptol. ePrint Arch.*, p. 1357, Oct. 2020.

C. Zuo, S.-F. Sun, J. K. Liu, J. Shao, J. Pieprzyk, and L. Xu, "Forward and backward private DSSE for range queries," *IEEE Trans. Dependable Secure Comput.*, vol. 19, no. 1, pp. 328–338, Jan. 2022.

I. Chillotti, N. Gama, M. Georgieva, and M. Izabachène, "Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds," in *Proc. ASIACRYPT*. Berlin, Germany: Springer, 2016, pp. 3–33.

M. Karnaugh, "The map method for synthesis of combinational logic circuits," *Trans. Amer. Inst. Electr. Eng., I, Commun. Electron.*, vol. 72, no. 5, pp. 593–599, Nov. 1953.

O. Regev, "On lattices, learning with errors, random linear codes, and cryptography," *J. ACM*, vol. 56, no. 6, pp. 1–40, Sep. 2009.

V. Lyubashevsky, C. Peikert, and O. Regev, "On ideal lattices and learning with errors over rings," *J. ACM*, vol. 60, no. 6, pp. 1–35, Nov. 2013.

K. Matsuoka, R. Banno, N. Matsumoto, T. Sato, and S. Bian, "Virtual secure platform: A five-stage pipeline processor over TFHE," in *Proc. USENIX Secur.*, 2021, pp. 4007–4024.

Downloads

Published

30-05-2025

Issue

Section

Research Articles

How to Cite

[1]
Mallem Anusha and DR. K. Venkataramana, “Dynamic Searchable Symmetric Encryption Technique for Secure Cloud Storage”, Int J Sci Res Sci Eng Technol, vol. 12, no. 3, pp. 596–602, May 2025, Accessed: Jun. 04, 2025. [Online]. Available: https://ijsrset.com/index.php/home/article/view/IJSRSET251284

Similar Articles

1-10 of 72

You may also start an advanced similarity search for this article.