Ensuring Semantic Security in Keyword Search using Searchable Public-Key Ciphertexts with Hidden Structures

Abstract

This paper propose searchable public key ciphertexts with inconspicuous structure for catchphrase investigate as quick as doable lacking giving up semantic security of the scrambled watchwords. In SPCHS, each one watchword searchable ciphertext are arranged by inconspicuous relative, and with the pursuit trapdoor consequent to a catchphrase, the littlest sum in succession of the relations is identify with a search for calculation as the supervision to find all comparing ciphertext capably. In SPCHS (Searchable Public-Key Ciphertexts with Hidden Structures), all catchphrase searchable ciphertexts are organized by concealed relations, and with the inquiry trapdoor relating to a watchword, the base data of the relations is revealed to a hunt calculation as the direction to locate all coordinating ciphertexts proficiently. The inquiry intricacy of our plan is reliant on the genuine number of the ciphertexts containing the questioned catchphrase, instead of the quantity of all ciphertexts. At long last, we introduce a non specific SPCHS development from mysterious character based encryption and crash free full-personality moldable Identity-Based Key Encapsulation Mechanism (IBKEM) with secrecy. We outline two impact free full-character pliant IBKEM examples, which are semantically secure and unknown, individually.

Authors and Affiliations

P Gnana Iswarya| M.Tech (CSE), Dhanekula Institute of Engineering & Technology, A.P., India, P Sunitha| Asst.Professor, Dept. of Computer Science & Engineering, Dhanekula Institute of Engineering & Technology, A.P., India

Keywords

Related Articles

Effect of Condenser Pressure (Vacuum) On Efficiency And Heat Rate of Steam Turbine

Electricity plays a vital role in our daily life. The power demand is increasing day by day due to increasing the population. The power is required for Industrialization and development of nation. Our country mainly...

An opportunistic routing algorithm adopts no awareness about the channel statistics and network, but practices a reinforcement learning framework in order to qualify the nodes to familiarize their routing strategies,...

Secure Gratified Allocation with Uncontrived System in Adhoc Networks

The open nature of wireless medium to disputes the network capacity. The adhoc networks presently categorized on cost and distance based networks, these are lack of network information and unpredictable mobility calc...

A Secure and authorized Duplication model in Cloud Using multi-layered cryptosystem based

the present a scheme that permits a more fine-grained trade-off. The intuition is that outsourced data may require different levels of the protection, depending on how to popular it is: content shared by many users,...

To Improve The Security Of OLSR Routing Protocol Based On Local Detection Of Link Spoofing

We survey a particular DOS attack called node separation attack and propose another moderation technique. Our answer called Denial Contradictions with Fictitious Node Mechanism (DCFM) depends on the interior informat...

Download PDF file
  • EP ID EP16768
  • DOI -
  • Views 319
  • Downloads 6

How To Cite

P Gnana Iswarya, P Sunitha (2016). Ensuring Semantic Security in Keyword Search using Searchable Public-Key Ciphertexts with Hidden Structures. International Journal of Science Engineering and Advance Technology, 4(7), 352-356. https://europub.co.uk./articles/-A-16768