In this paper, we propose an innovative approach to enhance the security and resilience of passkeys. this approach combines Shamir’s Secret Sharing Scheme, Reed–Solomon error-correcting codes, AES-GCM encryption, and decentralized storage systems such as blockchain and IPFS. In this approach, the adopted methodology is structured around three main phases: (i) passkey fragmentation, (ii) distributed and secure storage of fragments, and (iii) secret reconstruction when required. We evaluated our scheme, referred to as F2S-ECC (Fast Fourier Shamir with Error-Correcting Codes), across multiple dimensions. First, the complexity analysis shows a performance of order \mathcal{O}\left( {nlogn} \right)\mathcal{O}\left( {nlogn} \right), ensuring computational efficiency suitable for distributed environments. Second, the scalability evaluation of the decentralized storage mechanism highlights its improved ability to adapt to increasing data volume and the number of participants. Finally, the security of the scheme was validated through formal verification in the Dolev–Yao model, demonstrating that no attacks could compromise the confidentiality, integrity, or availability of passkeys. These results emphasize the relevance of our approach in addressing the challenges of secure protection and recovery of passkeys in distributed and low-trust environments.

Solid modeling, Scalability, Computational modeling, Resists, Robustness, Error correction codes, Blockchains, Encryption, Secure storage, Resilience, Passkey System, Blockchain, Error-Correcting Codes, Security