Authentication as A Service Based on Shamir Secret Sharing

Andrea Bissoli, Fabrizio d'Amore
{"title":"Authentication as A Service Based on Shamir Secret Sharing","authors":"Andrea Bissoli, Fabrizio d'Amore","doi":"10.1109/ISCSIC54682.2021.00072","DOIUrl":null,"url":null,"abstract":"We consider a solution for securing the classical password-based authentication scheme, because in many cases this type of authentication is given as a requirement. Our solution is based on the well-known $(k,n)$ threshold scheme of Shamir for sharing a secret, where in our case the secret is the password itself and $(k,\\ n)$ threshold scheme means that $n$ password-derived secrets (shares) are created and $k\\leq n$ shares are necessary and sufficient for reconstructing the password, while $k-1$ are not sufficient. The scheme is information-theoretic secure. We improve the approach so that the password is one-time. Since each of the $n$ shares is stored on a different host (Shareholder), an attacker will need to compromise $k$ different Shareholders for obtaining an amount of data sufficient for reconstructing the secret. Furthermore, to be resistant to the compromising of the server (Dealer) coordinating the Shareholders, we define a variant of the classic Shamir, where the Shamir's abscissas are unknown to Dealer and Shareholders, making the reconstruction impossible even in the case of Dealer and Shareholders compromised. In addition, we apply the Pedersen method for allowing the verification of shares. For the described scenario we have designed two protocols allowing the communication between application, Dealer and Shareholders, so that the relevant players can participate in the phases of registration (users sign-up, to be carried out once), and of authentication (users login). We analyse several scenarios where Dealer and/or Shareholders are partially/totally compromised and confirm that none of them is enabling the attacker to break the authentication. Furthermore we focus on cases where one or more byzantine servers are presented, analysing the impact on the authentication and show the adopted mechanisms to be secure against these kinds of attacks. We have developed a prototype demonstrating that our method works correctly, effectively and efficiently. It provides a first feasibility study that will provide a base for structured and engineered cloud-based implementations aiming at providing what we call an authentication-as-a-service.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCSIC54682.2021.00072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider a solution for securing the classical password-based authentication scheme, because in many cases this type of authentication is given as a requirement. Our solution is based on the well-known $(k,n)$ threshold scheme of Shamir for sharing a secret, where in our case the secret is the password itself and $(k,\ n)$ threshold scheme means that $n$ password-derived secrets (shares) are created and $k\leq n$ shares are necessary and sufficient for reconstructing the password, while $k-1$ are not sufficient. The scheme is information-theoretic secure. We improve the approach so that the password is one-time. Since each of the $n$ shares is stored on a different host (Shareholder), an attacker will need to compromise $k$ different Shareholders for obtaining an amount of data sufficient for reconstructing the secret. Furthermore, to be resistant to the compromising of the server (Dealer) coordinating the Shareholders, we define a variant of the classic Shamir, where the Shamir's abscissas are unknown to Dealer and Shareholders, making the reconstruction impossible even in the case of Dealer and Shareholders compromised. In addition, we apply the Pedersen method for allowing the verification of shares. For the described scenario we have designed two protocols allowing the communication between application, Dealer and Shareholders, so that the relevant players can participate in the phases of registration (users sign-up, to be carried out once), and of authentication (users login). We analyse several scenarios where Dealer and/or Shareholders are partially/totally compromised and confirm that none of them is enabling the attacker to break the authentication. Furthermore we focus on cases where one or more byzantine servers are presented, analysing the impact on the authentication and show the adopted mechanisms to be secure against these kinds of attacks. We have developed a prototype demonstrating that our method works correctly, effectively and efficiently. It provides a first feasibility study that will provide a base for structured and engineered cloud-based implementations aiming at providing what we call an authentication-as-a-service.
基于Shamir秘密共享的认证即服务
我们考虑一种保护经典的基于密码的身份验证方案的解决方案,因为在许多情况下,这种类型的身份验证是一种需求。我们的解决方案基于Shamir众所周知的用于共享秘密的$(k,n)$阈值方案,在我们的示例中,秘密是密码本身,$(k,\ n)$阈值方案意味着创建$n$密码派生的秘密(共享),并且$k\leq n$共享对于重建密码是必要和充分的,而$k-1$是不够的。该方案是信息论安全的。我们改进了这种方法,使密码是一次性的。由于每个$n$共享存储在不同的主机(股东)上,攻击者需要破坏$k$不同的股东,以获得足够的数据量来重建秘密。此外,为了抵抗协调股东的服务器(经销商)的妥协,我们定义了经典Shamir的一种变体,其中Shamir的横坐标对于经销商和股东来说是未知的,即使在经销商和股东妥协的情况下也无法重建。此外,我们应用Pedersen方法来允许对股票进行验证。对于所描述的场景,我们设计了两个允许应用程序、经销商和股东之间通信的协议,以便相关参与者可以参与注册阶段(用户注册,执行一次)和身份验证阶段(用户登录)。我们分析了经销商和/或股东部分/完全受损的几个场景,并确认它们都没有使攻击者能够破坏身份验证。此外,我们将重点关注出现一个或多个拜占庭服务器的情况,分析其对身份验证的影响,并展示所采用的防止此类攻击的安全机制。我们已经开发了一个原型,证明我们的方法是正确、有效和高效的。它提供了第一个可行性研究,将为结构化和工程化的基于云的实现提供基础,旨在提供我们所谓的身份验证即服务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信