Trusted Data Retrieval: A Verifiable Search Model for Multi-Tenant Applications

View at publisher Summarise with VIRAT
Authors: Pavan Kalyan Y, Dr. Ravi Kumar Y
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This research proposes a Verifiable Search Model to address the critical security and privacy challenges of cross-tenant data retrieval in multi-tenant cloud environments. Traditional searchable encryption targets single-tenant architectures, lacking essentialmechanisms for result verifiability and user accountability. To overcome these limitations, our objective is to facilitate secure, collaborative datasharing without compromising data confidentiality. The methodology integrates Elliptic Curve Cryptography (ECC) for lightweight data encryption and secure search token generation, alongside SHA-256 hashing for effective data deduplication and keyword index integrity. Furthermore, a partitioned inverted index is employed to process large-scale queries via fast parallel processing. Performance evaluations against standard RSA-basedand sequential search techniques demonstrate that the proposed model significantly reduces computational overhead and search latency. Theresults confirm faster parallel execution, guaranteed result verifiability, strict user accountability, andoptimized cloud storage capacity. Ultimately, thissystem provides a highly scalable and trustworthy cryptographicsearch mechanism for moderncollaborative cloud applications. curve Key Words: Multi-tenancy, searchable encryption, ellipticcryptography, data deduplication, verifiable search, parallel processing.

Fields of Study & Subjects

Cryptography and Data Security Cloud Data Security Solutions Blockchain Technology Applications and Security

Publication details

Journal / source
International Scientific Journal of Engineering and Management
Volume
05
Issue
03
Pages
1–9
Publication date
21 March 2026
Language
EN