Process Scheduling of Personal Identity Verification on Decentralized Trust

Koki Inoue, Dai Suzuki, T. Kurita, Satoshi Imai
{"title":"Process Scheduling of Personal Identity Verification on Decentralized Trust","authors":"Koki Inoue, Dai Suzuki, T. Kurita, Satoshi Imai","doi":"10.1109/BRAINS49436.2020.9223301","DOIUrl":null,"url":null,"abstract":"Several working groups are coping with an ecosystem where a user manages his/her own digital identity (ID) information among different organizations or companies by decentralized manner. We have also been developing a platform for trustworthy ID exchange, named IDYX. In the platform, personal identity verification (PIV) process will be realized by verifying credentials about users’ information issued by other organizations. Thanks to that kind of the ID cooperation, the users can prove their ID online by using the credentials and will no longer need to take procedure for every organization when updating their ID information registered there. However, the organizations’ policies to identify a user and relationships among the organizations bring a complicated problem, that is, how to get a better schedule of ID cooperation around them. In this paper, we formulate the scheduling problem as an integer linear programming, and propose a heuristic method based on graph structure. Numerical experiments show that the heuristic approach has feasible scalability for practical use.","PeriodicalId":315392,"journal":{"name":"2020 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRAINS49436.2020.9223301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Several working groups are coping with an ecosystem where a user manages his/her own digital identity (ID) information among different organizations or companies by decentralized manner. We have also been developing a platform for trustworthy ID exchange, named IDYX. In the platform, personal identity verification (PIV) process will be realized by verifying credentials about users’ information issued by other organizations. Thanks to that kind of the ID cooperation, the users can prove their ID online by using the credentials and will no longer need to take procedure for every organization when updating their ID information registered there. However, the organizations’ policies to identify a user and relationships among the organizations bring a complicated problem, that is, how to get a better schedule of ID cooperation around them. In this paper, we formulate the scheduling problem as an integer linear programming, and propose a heuristic method based on graph structure. Numerical experiments show that the heuristic approach has feasible scalability for practical use.
去中心化信任下的个人身份验证进程调度
几个工作组正在应对用户以分散的方式在不同组织或公司之间管理自己的数字身份(ID)信息的生态系统。我们也一直在开发一个值得信赖的ID交换平台,名为IDYX。在平台中,个人身份验证(PIV)过程将通过验证其他组织颁发的用户信息的凭证来实现。由于这种身份合作,用户可以使用凭证在线证明他们的身份,并且不再需要在每个组织更新他们在那里注册的身份信息时都要走程序。然而,组织的用户识别策略和组织之间的关系带来了一个复杂的问题,即如何围绕它们获得更好的ID合作计划。本文将调度问题表述为一个整数线性规划问题,并提出了一种基于图结构的启发式方法。数值实验表明,该方法具有实际应用的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信