A Decentralized-Network Based Digital Wallet Backup Scheme

Recently,blockchain technology has led to the wave of decentralized applications.In these blockchain applications,users prove their assets with a private key stored in their digital wallet.From this perspective,a digital wallet can be considered as a personal asset of the user.If a digital wallet's storage device is damaged or lost,its user will suffer unrecoverable loss.Therefore,a backup is necessary for the digital wallet.However,the existing storage solutions for digital wallet backup components are actually not perfect enough.The local storage solution,as a common option,requires users to organize and manage digital wallet devices by themselves and results in high management risks and maintenance costs.Managed storage solutions,on the other hand,rely on third-party organizations whose credibility is hard to be guaranteed.In response to these problems,this thesis focuses on the research in the backup of digital wallets.Based on a decentralized network with the characteristics of high fault tolerance,antiattack,anti-collusion,and high scalability,the paper proposes a digital wallet backup solution that is simple,economical,and robust.The main contributions of this thesis are as follows:1)Summarize the limitations of the existing digital wallet backup solutions,and analyze the advantages of the non-centralized network and the feasibility of its application in digital wallet backup problems.Propose a digital wallet backup scheme based on the decentralized network.2)Propose multi-constrained derangement distribution method(MCDD)for digital wallet backup which realizes decentralized storage of backup data.This method draws on the idea of Bernoulli derangement algorithm,integrates storage resources in units of user clusters,and uses network flow model to calculate feasible solutions for multi-constrained derangement distribution.3)Improve the centralized architecture service mode of Hordes anonymous jump strategy and transform it into a centralized anonymous jump strategy(D-Hordes)based on Kademlia routing protocol.Achieve the goal of adapting to decentralized network architecture and data security distribution.By combining Shamir secret sharing algorithm with Kademlia exclusive or distance measurement method,Shamir-Kademlia neighborhood(SKN)redundancy strategy is designed to improve the average availability probability of backup data and ensure the availability of backup data in open networks.4)Experiments are designed to compare the performance of the MCDD algorithm with that of traditional directory-based random distribution(DBD)algorithm.The advantages of this method in space utilization and invulnerability are verified.The usability and security of this scheme are analyzed based on the general framework of digital wallet evaluation,which proves that this scheme has better decentralization performance.