On Secret Sharing with Newton’s Polynomial for Multi-Factor Authentication
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...
Main Authors: | Sergey Bezzateev, Vadim Davydov, Aleksandr Ometov |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-12-01
|
Series: | Cryptography |
Subjects: | |
Online Access: | https://www.mdpi.com/2410-387X/4/4/34 |
Similar Items
-
An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial
by: Zhen Wu, et al.
Published: (2019-01-01) -
Polynomial Based Progressive Secret Image Sharing Scheme With Smaller Shadow Size
by: Yongzhen Guo, et al.
Published: (2019-01-01) -
A Novel Threshold Changeable Secret Image Sharing Scheme
by: Guohua Wu, et al.
Published: (2021-02-01) -
A New Secret Sharing Scheme Based on Polynomials over Finite Fields
by: Selda Çalkavur, et al.
Published: (2020-07-01) -
Efficient and Lossless Polynomial-Based Secret Image Sharing for Color Images
by: Qinghong Gong, et al.
Published: (2019-01-01)