Author Login IJIRT Partner Network (IPN) Login

Adaptive Query Processing Over Encrypted Data Using Blow-fish

  • Unique Paper ID: 159035
  • Volume: 9
  • Issue: 11
  • PageNo: 247-253
  • Abstract:
  • Processing nearest neighbor queries is a fundamental problem that occurs in many sectors, including machine learning and geographic databases. This research focuses on the Secure Nearest Neighbor (SNN) issue in cloud computing. Prior SNN systems have been ineffective and unsafe. In the present article, we officially establish and empirically demonstrate that the SNN scheme ASPE is truly vulnerable to ciphertext-only attacks. Although previous study showed that building an SNN method is difficult even in significantly permissive standard security models, we highlight the shortcomings of the hardness proof. We present an SNN architecture and show how it can withstand adaptive chosen keyword assaults. Because the complexity of processing queries is exponential, our method is efficient. We created our SNN scheme in C++ and compared its performance with a plain text scheme, a binary scheme, and a PIR scheme on a massive collection of over 10 million real-world data points to determine its efficiency. Experiment findings demonstrate that our scheme is both fast (0.124 millisecond per query when the data set size is 10 million) and scalable in terms of data points.
Download article email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 9
  • Issue: 11
  • PageNo: 247-253

Adaptive Query Processing Over Encrypted Data Using Blow-fish

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry