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

Yaddala Pavan Kalyan¹, Dr. Y. Ravi Kumar²,

¹P.G Scholar, Department of CSE, Sree Rama Engineering College, Tirupati, Andhra Pradesh, India, pavankalyanyaddala@gmail.com

²Professor, Department of CSE, Sree Rama Engineering College, Tirupati, Andhra Pradesh, India, Y.ravi@sreerama.ac.in

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.