Untitled

Cabello, Sergio; Padrö, Carles; Sáez, Germán

doi:10.1023/a:1013856431727

Cited by 65 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Detecting cheaters on the Internet has been an important issue, such as astroturfing detection [13][14][15], and a diversity of techniques concerning this matter have been proposed so far. Several studies have been carried out on cheater detection in secret sharing schemes [16][17][18][19]. The results of these techniques are only applicable to secret sharing schemes and thus may not be used to verify the correct-ness of the new shares computed by secure multi-party computation (SMC) protocol.…”

mentioning

confidence: 99%

Fair and Secure Multi-Party Computation with Cheater Detection

Seo

2021

Cryptography

View full text Add to dashboard Cite

Secure multi-party computation (SMC) is a cryptographic protocol that allows participants to compute the desired output without revealing their inputs. A variety of results related to increasing the efficiency of SMC protocol have been reported, and thus, SMC can be used in various applications. With the SMC protocol in smart grids, it becomes possible to obtain information for load balancing and various statistics, without revealing sensitive user information. To prevent malicious users from tampering with input values, SMC requires cheater detection. Several studies have been conducted on SMC with cheater detection, but none of these has been able to guarantee the fairness of the protocol. In such cases, only a malicious user can obtain a correct output prior to detection. This can be a critical problem if the result of the computation is real-time information of considerable economic value. In this paper, we propose a fair and secure multi-party computation protocol, which detects malicious parties participating in the protocol before computing the final output and prevents them from obtaining it. The security of our protocol is proven in the universal composability framework. Furthermore, we develop an enhanced version of the protocol that is more efficient when computing an average after detecting cheaters. We apply the proposed protocols to a smart grid as an application and analyze their efficiency in terms of computational cost.

show abstract

mentioning

confidence: 99%

Fair and Secure Multi-Party Computation with Cheater Detection

Seo

2021

Cryptography

View full text Add to dashboard Cite

show abstract

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

Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes

Crépeau

Gottesman

Smith

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies to codes which recover the message exactly. Naively, one might expect that correcting errors to very high fidelity would only allow small violations of this bound. This intuition is incorrect: in this paper we describe quantum error-correcting codes capable of correcting up to ⌊(n − 1)/2⌋ arbitrary errors with fidelity exponentially close to 1, at the price of increasing the size of the registers (i.e., the coding alphabet). This demonstrates a sharp distinction between exact and approximate quantum error correction. The codes have the property that any t components reveal no information about the message, and so they can also be viewed as error-tolerant secret sharing schemes.The construction has several interesting implications for cryptography and quantum information theory. First, it suggests that secret sharing is a better classical analogue to quantum error correction than is classical error correction. Second, it highlights an error in a purported proof that verifiable quantum secret sharing (VQSS) is impossible when the number of cheaters t is n/4. In particular, the construction directly yields an honest-dealer VQSS scheme for t = ⌊(n − 1)/2⌋. We believe the codes could also potentially lead to improved protocols for dishonest-dealer VQSS and secure multi-party quantum computation.More generally, the construction illustrates a difference between exact and approximate requirements in quantum cryptography and (yet again) the delicacy of security proofs and impossibility results in the quantum model.

show abstract

Untitled

Cited by 65 publications

References 19 publications

Fair and Secure Multi-Party Computation with Cheater Detection

Fair and Secure Multi-Party Computation with Cheater Detection

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

Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes

Contact Info

Product

Resources

About