Design a Model in Alleviating Search Time in Large-Scale Database Retrieval

Authors

  • Thallapally A Dept. of Computer Science and Engineering, SVS Group of Institutions, Bheemaram, Hanamkonda, India
  • P Poojitha Dept. of Computer Science and Engineering, University PG College, KU, Subedari , Hanamkonda, India
  • Manda S Dept. of Computer Science and Engineering, SVS Group of Institutions, Bheemaram, Hanamkonda, India

DOI:

https://doi.org/10.26438/ijcse/v5i10.247249

Keywords:

Public-key encryption by keyword search, Semantic security

Abstract

The notion of traditional public-key encryption by keyword search does not hold any hidden structure between the public-key encryption by keyword search cipher-texts; respectively, its semantic security is just defined for the keywords. We are concerned in provision of efficient search performance devoid of sacrificing semantic security within public-key encryption by keyword search. In our work we introduce searchable public-key cipher-texts by hidden structures in support of keyword search as fast as feasible devoid of sacrificing semantic security regarding encrypted keywords. Our structure is inspired by quite a lot of interesting observations based on the mechanisms of on Identity-Based Key Encapsulation. In the proposed system, the entire keyword-searchable cipher-texts that are structured by hidden relations, and by search trapdoor that corresponds to a keyword, minimum data of relations is revealed to a search algorithm as management to discover the entire matching cipher-texts resourcefully.

References

Ducas L.: “Anonymity from Asymmetry: New Constructions for Anonymous HIBE” In: Pieprzyk J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 148-164. Springer, Heidelberg (2010).

Abdalla M., Catalano D., Fiore D.: “Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions. Journal of Cryptology”, 27(3), pp. 544-593 (2013)

Freire E.S.V., Hofheinz D., Paterson K.G., Striecks C.: “Programmable Hash Functions in the Multilinear Setting”. In: Canetti R., Garay J.A. (eds.) Advances in Cryptology - CRYPTO 2013. LNCS, vol. 8042, pp. 513-530. Springer, Heidelberg (2013)

Bellovin S. M., Cheswick W.R.: “Privacy-Enhanced Searches Using Encrypted Bloom Filters. Cryptography” ePrint Archive, Report 2004/022 (2004)

Agrawal R., Kiernan J., Srikant R., Xu Y.: “Order Preserving Encryption for Numeric Data”. In: Proceedings of the 2004 ACM SIGMOD international conference on Management of data, pp. 563-574. ACM (2004)

Chang Y.-C., Mitzenmacher M.: “Privacy Preserving Keyword Searches on Remote Encrypted Data”. In: Ioannidis J., Keromytis A. and Yung M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442-455. Springer, Heidelberg (2005).

Downloads

Published

2025-11-12
CITATION
DOI: 10.26438/ijcse/v5i10.247249
Published: 2025-11-12

How to Cite

[1]
A. Thallapally, P. Poojitha, and S. Manda, “Design a Model in Alleviating Search Time in Large-Scale Database Retrieval”, Int. J. Comp. Sci. Eng., vol. 5, no. 10, pp. 24–249, Nov. 2025.

Issue

Vol. 5 No. 10 (2017): IJCSE October Edition

Section

Review Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.