Data Encryption using Geometric Range
Bhargavi Nadella · Asia-pacific Journal of Convergent Research Interchange · 2016
Geometric range scan is a key primitive for spatial information analysis in SQL and NoSQL databases.It has broad applications in area based administrations, PC aided design, and computational geometry.Due to the dramatic increase in information size, it is fundamental for organizations and associations to outsource their spatial informational indexes to outsider cloud administrations (e.g., Amazon) so as to decrease stockpiling and inquiry handling costs, at the same time, then, with the guarantee of no security spillage to the outsider.Searchable encryption is a system to perform significant inquiries on encoded information without uncovering security.In any case, geometric range seek on spatial information has not been completely researched nor upheld by existing searchable encryption plans.In this paper, we outline a symmetric-key searchable encryption plot that can bolster geometric range questions on encoded spatial information.One of our real commitments is that our plan is a general approach, which can bolster distinctive sorts of geometric range questions.At the end of the day, our plan on scrambled information is autonomous from the states of geometric range questions.In addition, we additionally develop our plan with the extra utilization of tree structures to accomplish look multifaceted nature that is speedier than straight.We formally characterize and demonstrate the security of our plan with indistinguishable capacity under specific picked plaintext assaults, and show the execution of our plan with trials in a genuine cloud stage (Amazon EC2).