Authentication as A Service Based on Shamir Secret Sharing

Author(s):  
Andrea Bissoli ◽  
Fabrizio d'Amore
Author(s):  
Mariya A. Gusarova ◽  

Most of the existing public key cryptosystems are potentially vulnerable to cryptographic attacks as they rely on the problems of discrete logarithm and factorization of integers. There is now a need for algorithms that will resist attacks on quantum computers. The article describes the implementation of Shamir’s post-quantum secret sharing scheme using long arithmetic that can be applied in modern cryptographic modules. The implementation of the Pedersen – Shamir scheme is described, which allows preserving the property of the perfection of the Shamir scheme by introducing testability. The article presents graphs reflecting the influence of the verifiability property in the Shamir secret sharing scheme on the speed of its operation.


Security is a significant concern in data innovation that managing the web world today. In sharing based technique shares are created, encoded and stored into digital form. This paper discussed the various papers in secret share creation for image security like visual secret share creation, Chinese remainder theorem, Shamir secret sharing and so on. In this design, a secret image is programmed into n shadows of the random model. It is possible to interpret the secret image externally by overlay a certified subset of shadows. These shares are uncovering the secret image to assume to be imprinted on transparencies and in the wake of stacking them to one another. Here more than fifteen papers are analyzed; those papers are gathered from IEEE, Springer, Elsevier and some other Journals. In addition, security measures are analyzed for all image secret sharing procedure.


Sign in / Sign up

Export Citation Format

Share Document