Secure and Efficient Steganography Scheme using 2-out-of-2 Secret Sharing Method
نویسندگان
چکیده
منابع مشابه
An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملUnconditionally Secure Verifiable Secret Sharing Scheme
Abstract A (t, n) secret sharing scheme permits a secret to be divided into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. Verifiable secret sharing (VSS) has been proposed to allow each shareholder to verify the validity of his own share, but not other shareholders' shares. In this paper, we propose an ...
متن کاملUnconditionally secure social secret sharing scheme
We introduce the notion of a Social Secret Sharing Scheme, in which shares are allocated based on a player’s reputation and the way he interacts with other participants. During the social tuning phase, weights of players are adjusted such that participants who cooperate will end up with more shares than those who defect. Alternatively, newcomers are able to be enrolled in the scheme while corru...
متن کاملMDS secret-sharing scheme secure against cheaters
For the problem of cheaters in secret sharing schemes, we introduce d cheat which is more appropriate than the minimum Hamming distance d min of the related error correcting code when it is needed only to recover the correct secret s (i.e., when it is not needed to identify the cheaters in the scheme). We then prove that d min d cheat = n ? max B6 2? jBj; where ? denotes the access structure.
متن کاملOptimum Secret Sharing Scheme Secure against Cheating
Tompa and Woll considered a problem of cheaters in (k; n) threshold secret sharing schemes. We rst derive a tight lower bound on the size of shares jV i j for this problem: jV i j (jSj 1)= + 1, where V i denotes the set of shares of participant P i , S denotes the set of secrets, and denotes the cheating probability. We next present an optimum scheme which meets the equality of our bound by usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2019
ISSN: 2321-9653
DOI: 10.22214/ijraset.2019.9151