Comments on Harn–Lin’s cheating detection scheme

Ghodosi, Hossein

doi:10.1007/s10623-010-9416-6

Cited by 16 publications

(15 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because Shamir's scheme is a linear scheme, Harn‐Lin's scheme is also a linear scheme, which is secure against cheating from multiple cheaters. But later, the literature showed that this scheme can be broken by an easy attack.…”

Section: Previous Work On Cheating Detectionmentioning

confidence: 99%

“…The restriction of Harn‐Lin's scheme is that more than k players are required in secret reconstruction for cheating prevention. But later, the literature showed that this scheme can be broken by an easy attack. In , a linear secret sharing scheme with cheating detection for a general access structure was proposed, and it can be applied on ( k , n ) secret sharing schemes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Linear (k,n) secret sharing scheme with cheating detection

Liu

2016

Security Comm Networks

View full text Add to dashboard Cite

Linear (k, n) secret sharing scheme with the capability of detecting cheating is considered in this paper. Linear (k, n) secret sharing scheme is a class of (k, n) secret sharing, where all the n shares of a secret satisfy a linear relationship. It plays an important role in other cryptographic systems, such as multi-party computation and function sharing schemes. On the other hand, cheating problem in (k, n) secret sharing is an important issue, such that cheaters (dishonest players) submit forged shares during secret reconstruction to fool honest players. During decades of research on cheating prevention, vast (k, n) secret sharing schemes against cheating have been proposed. However, most of these schemes are not linear schemes because it contains redundant information in their shares to achieve cheating detection. Because linear (k, n) secret sharing is an important primitive in threshold cryptography, linear (k, n) secret sharing scheme with the capability of cheating detection is also worthwhile to be discussed. In this paper, we propose a linear (k, n) secret sharing scheme against cheating based on Shamir's original scheme, which possesses the following merits: (1) Our scheme is just a combination of two Shamir's schemes. Therefore, our scheme can be used in other threshold cryptographic systems, which are based on Shamir's scheme. (2) The size of share in the proposed scheme almost reaches its theoretic lower bound in (k, n) secret sharing with cheating detection. (3) In the phase of cheating detection, only one honest player can detect the cheating from other k -1 cheaters, which achieves a stronger detection effective than the previous linear secret sharing schemes against cheating. secret reconstruction. Because Shamir's scheme is a linear scheme, Harn-Lin's scheme is also a linear scheme, which is secure against cheating from multiple cheaters. But later, the literature [22] showed that this scheme can be broken by an easy attack.Security Comm. Networks (2016)

show abstract

Section: Previous Work On Cheating Detectionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Linear (k,n) secret sharing scheme with cheating detection

Liu

2016

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…PBLS achieves the share size of |V | = | | / such that > 0 is the probability for successful cheating. Theorem 38 provides the security of PBLS and a proof on the share size of PBLS [30][31][32][33][34][35][36][37][38][39]. Theorem 38.…”

Section: Proposition 36 Let Be the Threshold Less Than Users Cannotmentioning

confidence: 99%

“…Liu et al 's scheme could be applied if system needs to share more than one secret [28]. Cramer et al 's scheme depends its security on the universal hash function, which means that it is not unconditionally secure, where Lin and Harn's scheme has been proved to be easily broken by a simple attack as pointed out by Ghodosi [30,31]. Liu et al 's scheme uses two polynomials to detect cheating during secret reconstruction and reduce the share size given to a user.…”

Section: Introductionmentioning

confidence: 99%

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

Phiri

Kim

2019

Security and Communication Networks

View full text Add to dashboard Cite

Threshold secret sharing is concerned with the splitting of a secret into shares and distributing them to some persons without revealing its information. Any ≤ persons possessing the shares have the ability to reconstruct the secret, but any persons less than 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 ( , ) 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.

show abstract

“…In addition, the approach of “majority voting” in our identification was first adopted in a cheating identification scheme where its practical applicability has been proved. Later, showed that the scheme can be broken by a flexible attack. The basic assumption in is that the attackers are malicious and they collude together to cheating.…”

Section: Proposed Verifiable Key Distribution Schemesmentioning

confidence: 99%

Verifiable symmetric polynomial‐based key distribution schemes

Liu

Zhang

Harn

et al. 2012

Security Comm Networks

View full text Add to dashboard Cite

Symmetric polynomial-based key distribution scheme has been widely adopted in various communication applications. This type of key distribution consists of a server and a set of users, where the server is responsible to distribute shares for each user via a symmetric polynomial. Based on the property of symmetry of this polynomial, each pair of users can compute a common secret key using their shares for establishing a secure communication channel. However, some users may receive faulty shares from the server because of some uncertain factors in the communication environment, such as software failures and transmission errors. As a result, the users who receive faulty shares cannot share common secret keys with other users. To solve this problem, in this paper, we propose two individual verifiable key distribution schemes on the basis of a symmetric polynomial based key distribution. In both our proposed schemes, the server adopts the same approach to distribute shares for users; the users are able to verify the validity of their shares without revealing them before establishing communication channels. If all shares are verified valid, users can ensure that each pair of them possesses a common secret key, they can establish secure communication channels when needed; otherwise, all users can collaborate to identify those users who possess faulty shares and require the server to distribute a set of valid shares for those users. Furthermore, both our proposed schemes are efficient, because the procedures of verification and identification do not involve any complicated cryptographic operation.

show abstract

Comments on Harn–Lin’s cheating detection scheme

Cited by 16 publications

References 4 publications

Linear (k,n) secret sharing scheme with cheating detection

Linear (k,n) secret sharing scheme with cheating detection

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

Verifiable symmetric polynomial‐based key distribution schemes

Contact Info

Product

Resources

About