检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周健[1,2] 屈冉 ZHOU Jian;QU Ran(School of Management Science and Engineering,Anhui University of Finance and Economics,Bengbu,Anhui 233030,China;School of Computer Science,Beijing University of Posts and Telecommunications,Beijing 100876,China)
机构地区:[1]安徽财经大学管理科学与工程学院,安徽蚌埠233030 [2]北京邮电大学计算机学院,北京100876
出 处:《计算机工程》2020年第11期23-28,共6页Computer Engineering
基 金:安徽省高等学校自然科学基金(KJ2019A0657,KJ2020A0013);安徽财经大学校级科研项目(ACKYB19012,ACKYB18010);安徽财经大学研究生科研创新基金(ACYC2018233)。
摘 要:针对区块链上用户私钥丢失后的安全恢复问题,提出一种基于门限秘密共享的私钥分布式管理方案。将用户私钥结合秘密口令构成秘密,通过门限密钥机制将秘密分割为多份秘密碎片,同时利用实用拜占庭容错算法将秘密碎片分配给网络中的诚实节点保管。当用户丢失私钥后,只要收集超过门限阈值份额的秘密碎片并结合秘密口令就可恢复私钥。分析结果表明,该方案具有抗合谋攻击、抗单点失效和匿名性等特性,并且可在保障用户私钥安全存储与动态管理的前提下,实现用户私钥丢失后的恢复功能。To address the security of the recovery of lost private keys on the blockchain,this paper proposes a distributed management scheme for private keys based on threshold secret sharing.The scheme combines the user’s private key with the secret password as a secret and uses the threshold key mechanism to divide the secret into several secret fragments,which are assigned to honest nodes for custody in the network by using the practical Byzantine fault tolerant algorithm.When the user’s private key is lost,the private key can be recovered by collecting secret fragments more than the threshold and combining them with the secret password.Analysis results show that this scheme is anonymous and resistant to collusion attacks and single node failure.It can implement recovery of the user’s lost private key while the dynamic management and secure storage of the private key is ensured.
关 键 词:区块链 私钥管理 门限密钥 实用拜占庭容错算法 密钥恢复
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7