R. Strobl. Dynamic groups in threshold cryptography. Diploma Thesis, Department of Computer Science, ETH Zurich, Winter 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Complete Specification of APIs and Protocols for the MAFTIA.. - Neves, (eds.) (2002) (1 citation) (Correct)
....parameters (such as the number and the identities of all members) We need three basic protocols to maintain the secret keys within a dynamic group: Add, Remove, and Reshare. Since this work is currently being developed, we only give a brief overview of these here; more details can be found in [68]. Protocol Add adds a new member to the group as a consequence of the joinGroup operation, and supplies the necessary secret keys. For the commonly used linear secret sharing schemes, this can be achieved by means of a distributed secure computation from which the new member learns its secret ....
....party. Protocol Reshare basically involves replacing the degree t sharing polynomial with a randomly chosen degree t # polynomial that shares the same secret. This is a well known primitive in synchronous threshold cryptography, but new protocols had to be developed for the asynchronous case [68]. 5.4.2 Membership with Support from the TTCB This section is concerned with site level membership, i.e. with groups of hosts. The membership service handles basically three operations: the addition of sites to a group, and the removal of sites from the group either due to a failure or to a ....
R. Strobl. Dynamic groups in threshold cryptography. Diploma Thesis, Department of Computer Science, ETH Zurich, Winter 2001.
First Specification of APIs and Protocols for the MAFTIA.. - Neves, Verissimo (2001) (1 citation) (Correct)
....instance of a View, which contains all relevant parameters (such as the number and the identities of all members) We need three basic protocols to maintain the secret keys within a dynamic group: Add, Remove, and Reshare. We give only a brief overview of these here; more details can be found in [46]. Protocol Add adds a new member to the group as a consequence of the joinGroup operation, and supplies the necessary secret keys. For the commonly used linear secret sharing schemes, this can be achieved by means of a distributed secure computation from which the new member learns its secret ....
....party. Protocol Reshare basically involves replacing the degree t sharing polynomial with a randomly chosen degree t 0 polynomial that shares the same secret. This is a well known primitive in synchronous threshold cryptography, but new protocols had to be developed for the asynchronous case [46]. 77 4.3 Activity Services This section describes at a high level the protocols used to implement the transactional support service. The following protocols are outlined in this section: Atomic commitment and abort protocols Recovery protocols, Distributed locking protocol, ....
R. Strobl. Dynamic groups in threshold cryptography. Diploma Thesis, Department of Computer Science, ETH Zurich, Winter 2001.
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