A Secure Key Escrow Mechanism Using ECC for Distributed Mobile Networks and Cloud Services
Prashant Shukla, Arun Ananthanarayanan, Mayur Bhoyar, Akhilesh Pahade, Paresh Tanna, Maisa Soujanya
Abstract
The suggested Key Escrow with Elliptic Curve Cryptography (KEECC) architecture uses Shamir's thresholds secret exchange approach in an elliptic curve cryptographic setting to improve privacy of information in apps that are distributed. It optimises storage needs, makes data transfer quicker and more secure, and decreases the number of secret keys. To ensure the security of personal information while it is being stored or transferred, the KEECC infrastructure has many encryption points. These include metadata servers, key escrow centres, and user devices. The technique guarantees strong privacy and secrecy by splitting secret keys among sub-keys utilising polynomials calculations and randomised integers. By providing flexible and dependable security mechanisms, KEECC's key restoring methods handle instances involving the loss, change, or deletion of secret keys. The platform's authenticity is further improved by validating and matching data encrypted to digitally signed documents that are distinct to each user. Particularly in terms of cost of computation and key storage finances, the method's Java version shows considerable gains over conventional RSA approaches. Compared to current approaches by a wide margin, the suggested KEECC system obtains an accuracy of 99.6%. Compared to Key Escrow based on ECC and RSA, it is light years ahead. Like KEECC, traditional cryptographic methods aren't as accurate as it is.