Next Article in Journal / Special Issue
Algorithm of Information Embedding into Digital Images Based on the Chinese Remainder Theorem for Data Security
Previous Article in Journal
Almost Fully Secured Lattice-Based Group Signatures with Verifier-Local Revocation
Open AccessLetter

On Secret Sharing with Newton’s Polynomial for Multi-Factor Authentication

1
Technologies of Information Security, Saint Petersburg State University of Aerospace Instrumentation, 190000 St. Petersburg, Russia
2
Faculty of Secure Information Technologies, ITMO University, 197101 St. Petersburg, Russia
3
Tampere University, 33720 Tampere, Finland
*
Author to whom correspondence should be addressed.
Received: 1 September 2020 / Revised: 17 November 2020 / Accepted: 26 November 2020 / Published: 1 December 2020
Security and access control aspects are becoming more and more essential to consider during the design of various systems and the tremendous growth of digitization. One of the related key building blocks in this regard is, essentially, the authentication process. Conventional schemes based on one or two authenticating factors can no longer provide the required levels of flexibility and pro-activity of the access procedures, thus, the concept of threshold-based multi-factor authentication (MFA) was introduced, in which some of the factors may be missing, but the access can still be granted. In turn, secret sharing is a crucial component of the MFA systems, with Shamir’s schema being the most widely known one historically and based on Lagrange interpolation polynomial. Interestingly, the older Newtonian approach to the same problem is almost left without attention. At the same time, it means that the coefficients of the existing secret polynomial do not need to be re-calculated while adding a new factor. Therefore, this paper investigates this known property of Newton’s interpolation formula, illustrating that, in specific MFA cases, the whole system may become more flexible and scalable, which is essential for future authentication systems. View Full-Text
Keywords: authentication; interpolation; Netwon’s polynomial; secret sharing authentication; interpolation; Netwon’s polynomial; secret sharing
MDPI and ACS Style

Bezzateev, S.; Davydov, V.; Ometov, A. On Secret Sharing with Newton’s Polynomial for Multi-Factor Authentication. Cryptography 2020, 4, 34. https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography4040034

AMA Style

Bezzateev S, Davydov V, Ometov A. On Secret Sharing with Newton’s Polynomial for Multi-Factor Authentication. Cryptography. 2020; 4(4):34. https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography4040034

Chicago/Turabian Style

Bezzateev, Sergey; Davydov, Vadim; Ometov, Aleksandr. 2020. "On Secret Sharing with Newton’s Polynomial for Multi-Factor Authentication" Cryptography 4, no. 4: 34. https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography4040034

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop