Strong (n,t,n) verifiable secret sharing scheme

Harn, Lein; Lin, Changlu

doi:10.1016/j.ins.2010.04.016

Cited by 75 publications

(53 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The basic principle behind this approach is to specify the secret S and use the generated curve based on the random coefficients a i to produce the secret shares S i . This methodology is successfully utilized in many secret sharing systems that employ the Lagrange interpolation formula [211,212]. Unfortunately, this approach may not be applied for the MFA scenario directly [213], since the biometric parameters are already in place, i.e., we can neither assign a new S i to a user nor modify them.…”

Section: Conventional Approachmentioning

confidence: 99%

Multi-Factor Authentication: A Survey

et al. 2018

View full text Add to dashboard Cite

Today, digitalization decisively penetrates all the sides of the modern society. One of the key enablers to maintain this process secure is authentication. It covers many different areas of a hyper-connected world, including online payments, communications, access right management, etc. This work sheds light on the evolution of authentication systems towards Multi-Factor Authentication (MFA) starting from Single-Factor Authentication (SFA) and through Two-Factor Authentication (2FA). Particularly, MFA is expected to be utilized for human-to-everything interactions by enabling fast, user-friendly, and reliable authentication when accessing a service. This paper surveys the already available and emerging sensors (factor providers) that allow for authenticating a user with the system directly or by involving the cloud. The corresponding challenges from the user as well as the service provider perspective are also reviewed. The MFA system based on reversed Lagrange polynomial within Shamir's Secret Sharing (SSS) scheme is further proposed to enable more flexible authentication. This solution covers the cases of authenticating the user even if some of the factors are mismatched or absent. Our framework allows for qualifying the missing factors by authenticating the user without disclosing sensitive biometric data to the verification entity. Finally, a vision of the future trends in MFA is discussed.

show abstract

Section: Conventional Approachmentioning

confidence: 99%

Multi-Factor Authentication: A Survey

et al. 2018

View full text Add to dashboard Cite

show abstract

“…In a VSS scheme, participants are able to verify that their shadows are consistent, and cheating by a dishonest dealer can be detected. VSS is now a fundamental tool in cryptographic research [14]. In order to resolve the problem in (4), cheating immune secret sharing [25,26,27,36] and publicly verifiable secret sharing (PVSS) [32] were investigated.…”

Section: A N U S C R I P Tmentioning

confidence: 99%

Attacks to some verifiable multi-secret sharing schemes and two improved schemes

Yan-hong

Zhang

2016

Information Sciences

View full text Add to dashboard Cite

“…Based on our scheme, we can further construct an ideal verifiable multi-secret sharing scheme by adding the existing verifiability methods where the intractability of discrete logarithm problem is frequently used (see [11][12][13]17,28,34,35]). …”

Section: Remarkmentioning

confidence: 99%

“…They analyzed (t, n) threshold schemes, which were the most practical and widely developed until now (see [1,7,13,[15][16][17]35]). In such schemes any set of at least t out of n participants can recover the secret, but sets of cardinality less than t have no information about it.…”

Section: Introductionmentioning

confidence: 99%