检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Zhiping Wang Meijiao Duan Maoning Wang
机构地区:[1]School of Information,Central University of Finance and Economics,Beijing,China
出 处:《国际计算机前沿大会会议论文集》2023年第1期372-388,共17页International Conference of Pioneering Computer Scientists, Engineers and Educators(ICPCSEE)
摘 要:We study the decentralized identity management mechanism based on blockchain.Finally,we propose an updatable and revocable decentralized identity management scheme DIURS.In the scheme,we construct the DID management tree,which is a dynamic chameleon authentication tree essentially by using the chameleon hash function.We design algorithms in detail from four stages:sys-tem initialization,identity creation,identity update and revocation,and identity verification.We make the DID documents on the blockchain editable successfully and realize the update and revocation of DIDs.Then,we observe that DIURS can meet the structural stability and irreversibility requirements.The time of identity search and update is milliseconds.The length of the identity authentication path is short.There is no need to save the historical version of DID documents.These results indicate that DIURS is not only safe and reliable but also performs well and achieves functional optimization.
关 键 词:Blockchain decentralized identity Chameleon hash function DID management tree
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249