نتایج جستجو برای: secret sharing
تعداد نتایج: 100605 فیلتر نتایج به سال:
This paper addresses the issue of state sharing in CSP‖B specifications: B machines controlled by various CSP parts are supposed not to refer to, share or modify the same state space. However, some kinds of B state sharing can be allowed without creating inconsistencies in CSP‖B specifications. To achieve this, we present an approach where inconsistencies in state sharing can be identified by t...
The idea of secret sharing is to start with a secret, divide it into pieces called shares, which are then distributed amongst participants by the dealer. Only certain authorized subsets of participants can reconstruct the original secret. Applications for secret sharing schemes seem to be getting more important nowadays. For many circumstances, secret sharing has to provide more flexibility and...
This article documents some of the known constructions for secret sharing schemes. It includes a discussion of the mathematical structures which have been used to model secret sharing schemes, the establishment of secret sharing schemes which do not require the existence of a trusted authority to administer them, variations which can be incorporated into these schemes to increase their flexibil...
Received October 28, 2006; accepted January 9, 2007 doi: 10.1007/s11433-008-0034-5 Corresponding author (email: [email protected]) Supported by the National Basic Research Program of China (973 Program) (Grant No. 2007CB311100), the National High Technology Research and Development Program of China (Grant Nos. 2006AA01Z419 and 20060101Z4015), the Major Research Plan of the National Natur...
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied in this paper for access structures with intersection number equal to one, that is, access structures such that there is at most one participant in the intersection of any two different minimal qualified subsets. The m...
In this paper, we present an efficient k-out-of-n secret sharing scheme, which can identify up to t rushing cheaters, with probability at least 1 − , where 0 < < 1/2, provided t < k/2. This is the optimal number of cheaters that can be tolerated in the setting of public cheater identification, on which we focus in this work. In our scheme, the set of all possible shares Vi satisfies the conditi...
A general theory for constructing linear secret sharing schemes over a finite field Fq from toric varieties is introduced. The number of players can be as large as (q − 1)r − 1 for r ≥ 1. We present general methods to obtain the reconstruction and privacy thresholds as well as conditions for multiplication on the associated secret sharing schemes. In particular we apply the method on certain to...
We define the notions of nest and influence of a subset of a critical set of a back circulant latin square, and study their properties. We also show that a secret sharing scheme based on a critical set of a latin square is both compartmentalised, and hierarchical.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید