Distributed Secure Multicast Protocol Clause Samples

Distributed Secure Multicast Protocol. The idea of extension of the ▇▇▇▇▇▇-▇▇▇▇▇▇▇ key exchange protocol for the multicasting is due to ▇▇▇▇▇▇▇ et al. (see [33]). In this paper authors suggested two protocols, and one of them, called CLIQUES, is used of the same authors in [34] for rekeying in Dynamic Peer Groups. Later, this idea is also used by other authors. For instance, ▇.-▇. Climent et al. in [35] employ noncommutative unitary ring of matrices for building the multicast protocol. In this paper, we use idempotent semirings for building our multicast protocol. Let the peers are denoted by P1 , P2 ,..., Pl . Peers agree on the two dual semifields D = S,⊕• ,⊗• , ⊥, T and D d = S,⊕• ,⊗• , ⊥, T . Let the matrix semirings, defined over S, D and D d be respectively M n×n (D), M n×n (Dd ) , M n×n (S) . Then if M ∈ M n×n (D), N ∈ M n×n (Dd ) , X ∈ M n×n (S) , and f (x) and g(x) be two polynomials of matrices over the dual semifields, the equality fi (M ) ⊗• f j (M ) ⊗• X ⊗• ▇ ▇ (N ) ⊗• gi (N ) = i • i j always hods.