How to Share a Secret

Mignotte, Maurice

doi:10.1007/3-540-39466-4_27

Cited by 204 publications

(128 citation statements)

References 0 publications

Supporting

Mentioning

128

Contrasting

Order By: Relevance

“…They use biometric for IBE to generate , A k n -threshold scheme as a method of sharing a secret S among a set of n participants in such a way that any k participants can compute the value of the secret, but no group of k − 1 or fewer can do so. The Chinese remainder theorem can be used to construct the secret S like in Mignotte's [9] and Asmuth-Bloom's Schemes [10]. However, it differs, as the secret points to one message, and k shares are needed to solve it using CRT.…”

Section: Background and Related Workmentioning

confidence: 99%

Ambiguous Multi-Symmetric Scheme and Applications

Bassous¹,

Mansour²,

Bassous³

et al. 2017

JIS

View full text Add to dashboard Cite

This paper introduces and evaluates the performance of a novel cipher scheme, Ambiguous Multi-Symmetric Cryptography (AMSC), which conceals multiple coherent plain-texts in one cipher-text. The cipher-text can be decrypted by different keys to produce different plain-texts. Security analysis showed that AMSC is secure against cipher-text only and known plain-text attacks. AMSC has the following applications: 1) it can send multiple messages for multiple receivers through one cipher-text; 2) it can send one real message and multiple decoys for camouflage; and 3) it can send one real message to one receiver using parallel processing. Performance comparison with leading symmetric algorithms (DES, AES and RC6) demonstrated AMSC's efficiency in execution time.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Ambiguous Multi-Symmetric Scheme and Applications

Bassous¹,

Mansour²,

Bassous³

et al. 2017

JIS

View full text Add to dashboard Cite

show abstract

“…In a ( , ) threshold secret-sharing scheme, the secret is divided into shares so that it can only be recovered with or more than shares, but fewer than shares cannot reveal any information of the secret. In the past few decades, many secret-sharing schemes have been proposed in the literature, and three major approaches can be used to design them: Shamir's approach [1] based on the univariate polynomial, Blakely's approach [2] based on the hyperplane geometry, and Mignotte/AsmuthBloom approach [3,4] based on the Chinese Remainder Theorem (CRT).…”

Section: Introductionmentioning

confidence: 99%

How to Share Secret Efficiently over Networks

Harn

Hsu

Xia

et al. 2017

Security and Communication Networks

View full text Add to dashboard Cite

In a secret-sharing scheme, the secret is shared among a set of shareholders, and it can be reconstructed if a quorum of these shareholders work together by releasing their secret shares. However, in many applications, it is undesirable for nonshareholders to learn the secret. In these cases, pairwise secure channels are needed among shareholders to exchange the shares. In other words, a shared key needs to be established between every pair of shareholders. But employing an additional key establishment protocol may make the secret-sharing schemes significantly more complicated. To solve this problem, we introduce a new type of secret-sharing, called protected secret-sharing (PSS), in which the shares possessed by shareholders not only can be used to reconstruct the original secret but also can be used to establish the shared keys between every pair of shareholders. Therefore, in the secret reconstruction phase, the recovered secret is only available to shareholders but not to nonshareholders. In this paper, an information theoretically secure PSS scheme is proposed, its security properties are analyzed, and its computational complexity is evaluated. Moreover, our proposed PSS scheme also can be applied to threshold cryptosystems to prevent nonshareholders from learning the output of the protocols.

show abstract

“…We are going to use the elementary additive secret sharing but also secret sharing based on Shamir secret sharing as in [1,2] and the BGW method [3,4]. We use also the Chinese Remainder Theorem (see [2] and [5]). In the area of multiparty computation, five papers [6][7][8][9][10] deserve special attention.…”

Section: Introductionmentioning

confidence: 99%