PolyAuth: Multi-polynomial based authentication scheme for secure data sharing in blockchain
Neha Mathur, Shweta Sinha, Rajesh Kumar Tyagi, Nishtha Jatana · 2025
In the digital world, secure data sharing and authentication are paramount, and several centralized as well as decentralized methods have been established in recent years. However, with such methods, data-sharing becomes fairly complicated for two reasons: first, standard data-sharing protocols are inapplicable, and second, exchanging encrypted data necessitates a blockchain-compatible key management system. Furthermore, the established schemes often exhibit privacy, scalability, and retrieval issues. As a result, to overcome these challenges, this research proposed a multi-polynomial-based authentication scheme (PolyAuth) for access control and data sharing. The PolyAuth scheme combines multiple polynomials to create a more complex and secure authentication mechanism that is resistant to attacks. Furthermore, the utilization of the Interplanetary File System (IPFS) shifts from location-based addressing to content-based addressing, which enhances the performance of the PolyAuth scheme. Each file is identified by a unique cryptographic hash based on its content which ensures efficient retrieval and eliminates the need for centralized servers. The results obtained using the proposed model show better performance with a minimal computational time of 80.79s and a detection rate of 0.75, which is superior to the other implemented schemes.