نتایج جستجو برای: secret sharing schemes
تعداد نتایج: 198401 فیلتر نتایج به سال:
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another participant reconstruct an invalid secret. We introduce a novel technique which uses universal hash functions to detect such cheating and propose two efficient secret sharing schemes that employ the functions. The first...
Secret sharing schemes protect secrecy and integrity of information by dividing it into shares and distributing these shares among different locations. In k + 1 out of n threshold schemes, security is assured if throughout the entire life-time of the secret the adversary compromises no more than k of the n locations. For long-lived and sensitive secrets this protection may be insufficient. We p...
The Visual Secret Sharing (VSS) scheme proposed by Naor and Shamir is a perfectly secure scheme to share a secret image. By using m sub pixels to represent one pixel, we encrypt the secret image into several noise-like shadow images. The value of m is known as the pixel expansion. More pixel expansion increases the shadow size and makes VSS schemes impractical for real application. In this pape...
In this paper, we consider three very important issues namely detection, identification and robustness of k-out-of-n secret sharing schemes against rushing cheaters who are allowed to submit (possibly forged) shares after observing shares of the honest users in the reconstruction phase. Towards this we present five different schemes. Among these, first we present two k-out-of-n secret sharing s...
Threshold secret sharing schemes do not prevent any malicious behavior of the dealer or shareholders and so we need verifiable secret sharing, to detect and identify the cheaters, to achieve fair reconstruction of a secret. The problem of verifiable secret sharing is to verify the shares distributed by the dealer. A novel approach for verifiable secret sharing is presented in this paper where b...
This note proposes a method of space efficient secret sharing in which k secrets are mapped into n shares (n ≥ k) of the same size. Since, n can be chosen to be equal to k, the method is space efficient. This method may be compared with conventional secret sharing schemes that divide a single secret into n shares.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید