Results 1 - 10
of
76,294
Table 1: Properties of different schemes
1998
"... In PAGE 18: ...Offered Functionality Table1 compares the properties for each scheme. Most properties are self-explanatory, the others are described here: Multiple leaves Multiple leaves are more difficult in the approaches using flat datastruc- tures.... In PAGE 21: ... As discussed in the introductory section, various authors have published work on secure multicasting schemes. Some of the properties as presented in Table1 are also offered by their approaches, but we are not aware of any scheme that has all these properties while maintaining the efficiency of ours. Some considerations deserve further studies.... ..."
Cited by 30
Table 1: Properties of different schemes
"... In PAGE 18: ...Offered Functionality Table1 compares the properties for each scheme. Most properties are self-explanatory, the others are described here: Multiple leaves Multiple leaves are more difficult in the approaches using flat datastruc- tures.... In PAGE 21: ... As discussed in the introductory section, various authors have published work on secure multicasting schemes. Some of the properties as presented in Table1 are also offered by their approaches, but we are not aware of any scheme that has all these properties while maintaining the efficiency of ours. Some considerations deserve further studies.... ..."
Table 1: Properties of different schemes
"... In PAGE 18: ...Offered Functionality Table1 compares the properties for each scheme. Most properties are self-explanatory, the others are described here: Multiple leaves Multiple leaves are more difficult in the approaches using flat datastruc- tures.... In PAGE 21: ... As discussed in the introductory section, various authors have published work on secure multicasting schemes. Some of the properties as presented in Table1 are also offered by their approaches, but we are not aware of any scheme that has all these properties while maintaining the efficiency of ours. Some considerations deserve further studies.... ..."
TABLE I PROPERTIES OF DIFFERENT SCHEMES
1999
Cited by 66
TABLE I PROPERTIES OF DIFFERENT SCHEMES
1999
Cited by 66
Table 1: Properties of different schemes
1999
"... In PAGE 5: ...to perform a35a36a25a38a37a39a29 exponentiations for each group change, and messages get prohibitively large. As summarized in Table1 , most existing protocols for secure multicasting are limited to distribute session keys in static and/or small groups. For dealing with the group key distribution in a large group with frequent membership changes, some good explorations have been done in [Mit97, STW97].... ..."
Cited by 66
TABLE I PROPERTIES OF DIFFERENT SCHEMES
1999
Cited by 66
TABLE I PROPERTIES OF DIFFERENT SCHEMES
1999
Cited by 66
Table 1: Properties of different schemes
"... In PAGE 5: ...to perform O(n) exponentiations for each group change, and messages get prohibitively large. As summarized in Table1 , most existing protocols for secure multicasting are limited to distribute session keys in static and/or small groups. For dealing with the group key distribution in a large group with frequent membership changes, some good explorations have been done in [Mit97, STW97].... ..."
Table 1: Properties of different schemes
"... In PAGE 5: ...to perform O(n) exponentiations for each group change, and messages get prohibitively large. As summarized in Table1 , most existing protocols for secure multicasting are limited to distribute session keys in static and/or small groups. For dealing with the group key distribution in a large group with frequent membership changes, some good explorations have been done in [Mit97, STW97].... ..."
Results 1 - 10
of
76,294