scholarly journals Application of Recursive Algorithm on Shamir's Scheme Reconstruction for Cheating Detection and Identification

2022 ◽  
Vol 4 (1) ◽  
Author(s):  
Rafika Husnia Munfa'ati ◽  
Sugi Guritman ◽  
Bib Paruhum Silalahi
Keyword(s):  
Recursive Algorithm ◽  
Secret Sharing Scheme ◽  
Matrix Structure ◽  
Primary Method ◽  
Sharing Scheme ◽  
Detection And Identification ◽  
Confidential Data ◽  
Cheating Detection ◽  
Linear Scheme ◽  
Secret Reconstruction

Information data protection is necessary to ward off and overcome various fraud attacks that may be encountered. A secret sharing scheme that implements cryptographic methods intends to maintain the security of confidential data by a group of trusted parties is the answer. In this paper, we choose the application of recursive algorithm on Shamir-based linear scheme as the primary method. In the secret reconstruction stage and since the beginning of the share distribution stage, these algorithms have been integrated by relying on a detection parameter to ensure that the secret value sought is valid. Although the obtained scheme will be much simpler because it utilizes the Vandermonde matrix structure, the security aspect of this scheme is not reduced. Indeed, it is supported by two detection parameters formulated from a recursive algorithm to detect cheating and identify the cheater(s). Therefore, this scheme is guaranteed to be unconditionally secure and has a high time efficiency (polynomial running time).

scholarly journals Linear (t,n) Secret Sharing Scheme with Reduced Number of Polynomials

2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Kenan Kingsley Phiri ◽  
Hyunsung Kim
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Threshold Secret Sharing ◽  
Sharing Scheme ◽  
Cheating Detection ◽  
Linear Scheme ◽  
Elgamal Cryptosystem ◽  
Important Branch

Threshold secret sharing is concerned with the splitting of a secret into n shares and distributing them to some persons without revealing its information. Any t ≤ n persons possessing the shares have the ability to reconstruct the secret, but any persons less than t cannot do the reconstruction. Linear secret sharing scheme is an important branch of secret sharing. The purpose of this paper is to propose a new polynomial based linear (t, n) secret sharing scheme, which is based on Shamir’s secret sharing scheme and ElGamal cryptosystem. Firstly, we withdraw some required properties of secret sharing scheme after reviewing the related schemes and ElGamal cryptosystem. The designed scheme provides the properties of security for the secret, recoverability of the secret, privacy of the secret, and cheating detection of the forged shares. It has half computation overhead than the previous linear scheme.

scholarly journals Applying cheating identifiable secret sharing scheme in multimedia security

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Zheng Ma ◽  
Yan Ma ◽  
Xiaohong Huang ◽  
Manjun Zhang ◽  
Yanxiao Liu
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Detection And Identification ◽  
Cheating Detection ◽  
Important Extension ◽  
Secret Image Sharing Scheme

Abstract In (k,n) secret sharing scheme, one secret is encrypted into n shares in such a way that only k or more shares can decrypt the secret. Secret sharing scheme can be extended into the field of multimedia that provides an efficient way to protect confidential information on multimedia. Secret image sharing is just the most important extension of secret sharing that can safely guard the secrecy of images among multiple participants. On the other hand, cheating detection is an important issue in traditional secret sharing schemes that have been discussed for many years. However, the issue of cheating detection in secret image sharing has not been discussed sufficiently. In this paper, we consider the cheating problem in the application of secret image sharing schemes and construct a (k,n) secret image sharing scheme with the ability of cheating detection and identification. Our scheme is capable of identifying cheaters when k participants involve in reconstruction. The cheating identification ability and size of shadow in the proposed scheme are improved from the previous cheating identifiable secret image sharing scheme.

scholarly journals A Publicly Verifiable Multi-Secret Sharing Scheme With Outsourcing Secret Reconstruction

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 70666-70673 ◽  
Author(s):  
Changlu Lin ◽  
Huidan Hu ◽  
Chin-Chen Chang ◽  
Shaohua Tang
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Multi Secret Sharing ◽  
Secret Reconstruction

scholarly journals A SECRET SHARING SCHEME BASED ON MULTIVARIATE POLYNOMIALS

2019 ◽  
Vol 2 (2) ◽  
pp. 81
Author(s):  
Ari Dwi Hartanto ◽  
Sutjijana Sutjijana
Keyword(s):  
Secret Sharing ◽  
Lagrange Interpolation ◽  
Partial Information ◽  
Interpolation Formula ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Multivariate Polynomials ◽  
Reconstruction Process ◽  
Sharing Scheme ◽  
Secret Reconstruction

A Secret sharing scheme is a method for dividing a secret into several partialinformation. The secret can be reconstructed if a certain number of partial information is collected. One of the known secret sharing schemes is the Shamir’s secret sharing scheme. It uses Lagrange interpolation (with one indeterminate) for reconstructing the secret. In this paper, we present a secret sharing scheme using multivariate polynomials with the secret reconstruction process using the multivariate interpolation formula derived by Saniee (2007). The resulted scheme can be considered as a generalization of the Shamir’s secret sharing scheme.

Sign in / Sign up

Export Citation Format

Share Document