C. Blundo, A. Cresti, A. D. Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Theoretical Computer Science, 165(2):407--440, October 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....additional cipher is needed to protect them in distribution. The reader is encouraged to look for other applications of the key transport protocol. Prepositioned secret sharing schemes may also be used in ID based key distribution protocols. Ramp schemes [22] or dynamic threshold schemes [23] [24], which are extensions of conventional threshold schemes, may prove useful in developing key transport pro tocols. ....

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, "Fully dynamic secret sharing schemes," Advances in Cryptology - CRYPTO '93 Proceedings, Springer-Verlag, pp. 110-125, 1994.

....a secret sharing scheme that enrolls (adds) shareholders in the access structure after the initial sharing [9] the new shareholders are a superset of the old ones. Blundo et al. present a scheme in which the dealer broadcasts messages to activate different, possibly disjoint, authorized subsets [7]. Blundo s scheme requires shareholders to have a share regardless of whether or not they are in the active authorized subset, in contrast to Desmedt and Jajodia s scheme. Our VSR protocol alters the access structure by physical redistribution of shares, and allows new shareholders to verify that ....

C. Blundo, A. Cresti, A. D. Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Theoretical Comput. Sci., 165(2):407--440, Oct. 1996.

....sharing scheme that enrolls (adds) shareholders in the access structure after the initial sharing [Cac95] the new shareholders are a superset of the old ones. Blundo et al. presents a scheme in which the dealer uses broadcast messages to activate different, possibly disjoint, authorized subsets [BCSV96] Blundo s scheme requires shareholders to have a share regardless of whether or not they are in the active authorized subset, in contrast to Desmedt and Jajodia s scheme. Our VSR protocol alters the threshold scheme by physical redistribution of shares, and allows new shareholders to verify that ....

Carlo Blundo, Antonella Cresti, Alfredo De Santis, and Ugo Vaccaro. Fully dynamic secret sharing schemes. Theoretical Computer Science, 165(2):407--440, October 1996.

.... [3] For these schemes, the set of new shareholders is not disjoint from the old; rather, it is either a superset (for Cachin) or a subset (for Blakley et al.) Blundo et al. presents a scheme in which the dealer uses broadcast messages to activate different, possibly disjoint, authorized subsets [4]. Blundo s scheme requires shareholders to have a share regardless of whether or not they are in the active authorized subset, in contrast to Desmedt and Jajodia s scheme. Our VSR protocol, like Desmedt and Jajodia s protocol, alters the access structure of a scheme by physical redistribution of ....

C. Blundo, A. Cresti, A. D. Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Theoretical Computer Science, 165(2):407--440, October 1996.

....by means of public key cryptography [13] 14] Public channels have been used in secret sharing (in addition to private channels) in dynamic sharing of secrets. These are schemes where the dealer enables parties to reconstruct different secrets in different time instants (e.g. 7] 15] [16]) A different scenario in which a public broadcast channel is used (in addition to private channels) is to protect against Byzantine parties [17] 18] Unlike our scenario, in those works the broadcast channel is heard by all parties. The rest of this paper is organized as follows: In Section II ....

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, "Fully dynamic secret sharing schemes," Theoretical Computer Science, vol. 165, no. 2, pp. 407--440, 1996.

....sharing schemes is put forward. A multi secret sharing scheme is a protocol to distribute n (maybe correlated) secrets s 1 ; s n among a set of participants P in such a way that it satisfies the properties of a secret sharing scheme for each of the secret. 7.2. 3 Fully Dynamic Schemes In [98] a formal setting is established to study secret sharing schemes in which different access structures and or different secrets can be activated in subsequent time instants simply by sending the same broadcast message to all participants. In this model the size of shares held by any participant and ....

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. In D. Stinson, editor, Advances in Cryptology -- CRYPTO '93, volume 773 of Lecture Notes in Computer Science, pages 110--125. Springer-Verlag, 1994.

....a new secret by broadcasting a message over a public channel. For perfect threshold schemes with m fold disenrollment it can be shown that the size of the initially distributed shares must grow linearly in m [2] These results are extended to general dynamic access structures by Blundo et al. [3]. Schemes for distributing multiple secrets are examined in [4] Recently, Krawczyk [10] introduced a construction for computationally secure threshold secret sharing schemes where the shares can be shorter than the secret and that uses a secure encryption function. Basically, this protocol works ....

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, Fully dynamic secret sharing schemes, in Advances in Cryptology --- CRYPTO '93, D. R. Stinson, ed., vol. 773 of Lecture Notes in Computer Science, Springer-Verlag, 1994, pp. 110--125.

No context found.

C. Blundo, A. Cresti, A. De Santis and U. Vaccaro. Fully dynamic secret sharing schemes. Presented at CRYPTO '93.

No context found.

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, Fully Dynamic Secret Sharing Schemes, in: Advances in Cryptology -- CRYPTO '93, D. Stinson (Ed.), Lectures Notes in Computer Science, Springer-Verlag, to appear.

....relevance of secret sharing schemes having the feature of being able, after some preprocessing stage, to allow the participants to reconstruct different secrets (in different time instants) by sending 3 to all participants the same broadcast message. Blundo, Cresti, De Santis, and Vaccaro [5] established a formal setting to study such schemes, referred to as dynamic threshold schemes. Blakley, Blakley, Chan, and Massey [3] and Martin [20] considered the problem of constructing secret sharing schemes with disenrollment capability in which, by sending a broadcast message to all ....

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, Fully Dynamic Secret Sharing Schemes, Theoretical Computer Science 155 (1996), pp. 407--410.

.... has the feature of being able (after a preprocessing stage) to activate a particular access structure out of a given set and or to allow the participants to reconstruct different secrets (in different time instants) by sending to all participants the same broadcast message have been analyzed in [6]. Schemes for sharing several non independent secrets simultaneously have been analyzed in [10] whereas, schemes where different secrets are associated with different subsets of participants are considered in [28] and [7] Recently, Naor and Shamir [35] considered a type of cryptographic scheme ....

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, Fully Dynamic Secret Sharing Schemes, in "Advances in Cryptology - CRYPTO 93", D.R. Stinson Ed., "Lecture Notes in Computer Science", Vol. 773, Springer-Verlag, Berlin, pp. 126--135, 1994.

No context found.

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, Fully Dynamic Secret Sharing Schemes, in: Advances in Cryptology -- CRYPTO '93, D. Stinson (Ed.), Lectures Notes in Computer Science, Springer-Verlag, to appear.

.... has the feature of being able (after a preprocessing stage) to activate a particular access structure out of a given set and or to allow the participants to reconstruct different secrets (in different time instants) by sending to all participants the same broadcast message have been analyzed in [6]. Schemes for sharing several non independent secrets simultaneously have been analyzed in [10] whereas, schemes where different secrets are associated with different subsets of participants are considered in [26] and [7] Recently Naor and Shamir [33] considered a type of cryptographic scheme ....

C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, Fully dynamic secret sharing schemes, in "Advances in Cryptology - CRYPTO 93", D.R. Stinson Ed., "Lecture Notes in Computer Science", Vol. 773, Springer-Verlag, Berlin, pp. 126--135, 1994.

.... has the feature of being able (after a preprocessing stage) to activate a particular access structure out of a given set and or to allow the participants to reconstruct different secrets (in different time instants) by sending to all participants the same broadcast message have been analyzed in [9]. ffl Schemes for sharing several non independent secrets simultaneously have been analyzed in [8] ffl Schemes where different secrets are associated with different subsets of participants are considered in [24] ffl The question of how to set up a secret sharing scheme in the absence of a ....

C. Blundo, A. Cresti, A. De Santis and U. Vaccaro. Fully dynamic secret sharing schemes. Presented at CRYPTO '93.

No context found.

C. Blundo, A. Cresti, A. D. Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Theoretical Computer Science, 165(2):407--440, October 1996.

No context found.

C. Blundo, A. Cresti, A. D. Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Theoretical Computer Science, 165(2):407--440, Oct. 1996.

No context found.

Carlo Blundo, Antonella Cresti, Alfredo De Santis, and Ugo Vaccaro. Fully dynamic secret sharing schemes. Theoretical Computer Science, 165(2):407--440, October 1996.

No context found.

C. Blundo, A. Cresti, A. De Santis and U. Vaccaro. (1994), Fully dynamic secret sharing schemes. Adv. in Cryptology - CRYPTO'93, Lecture Notes in Comput. Sci., 773, 110--125.

No context found.

C. Blundo, A. Cresti, A. De Santis and U. Vaccaro. Fully dynamic secret sharing schemes. Adv. in Cryptology - CRYPTO'93, Lecture Notes in Comput. Sci., 773, (1994), 110--125.

No context found.

C. Blundo, A. Cresti, A. De Santis and U. Vaccaro, "Fully dynamic secret sharing schemes," Advances in Cryptology -- CRYPTO '93 Proceedings, Springer-Verlag, pp. 110-125, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC