IEEE Style Citation: Adarana Thallapally, P. Poojitha, Sridhar Manda, “Design a Model in Alleviating Search Time in Large-Scale Database Retrieval,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.10, pp.247-249, 2017.
MLA Style Citation: Adarana Thallapally, P. Poojitha, Sridhar Manda "Design a Model in Alleviating Search Time in Large-Scale Database Retrieval." International Journal of Computer Sciences and Engineering 5.10 (2017): 247-249.
APA Style Citation: Adarana Thallapally, P. Poojitha, Sridhar Manda, (2017). Design a Model in Alleviating Search Time in Large-Scale Database Retrieval. International Journal of Computer Sciences and Engineering, 5(10), 247-249.
BibTex Style Citation:
@article{Thallapally_2017,
author = {Adarana Thallapally, P. Poojitha, Sridhar Manda},
title = {Design a Model in Alleviating Search Time in Large-Scale Database Retrieval},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {10 2017},
volume = {5},
Issue = {10},
month = {10},
year = {2017},
issn = {2347-2693},
pages = {247-249},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1507},
doi = {https://doi.org/10.26438/ijcse/v5i10.247249}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v5i10.247249}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1507
TI - Design a Model in Alleviating Search Time in Large-Scale Database Retrieval
T2 - International Journal of Computer Sciences and Engineering
AU - Adarana Thallapally, P. Poojitha, Sridhar Manda
PY - 2017
DA - 2017/10/30
PB - IJCSE, Indore, INDIA
SP - 247-249
IS - 10
VL - 5
SN - 2347-2693
ER -
VIEWS
PDF
XML
531
327 downloads
307 downloads
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.
Key-Words / Index Term
Public-key encryption by keyword search, Semantic security
References
[1] 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).
[2] 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)
[3] 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)
[4] Bellovin S. M., Cheswick W.R.: “Privacy-Enhanced Searches Using Encrypted Bloom Filters. Cryptography” ePrint Archive, Report 2004/022 (2004)
[5] 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)
[6] 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).
VIEWS
PDF 
XML 
