
doi: 10.1109/lcn.2007.83
handle: 10054/1287
Secure group communication has various applications. Requirements for an application differ in various parameters such as tolerance times for join and leave, arrival rate, departure rate, staying period and group life time. Existing group key agreement protocols do not harness knowledge of application requirements. In this paper we present scheme for tunable group key agreement. We introduce an application class awareness concept, rekeying algorithms and novel key tree structure. We simulated periodic refresh mode, periodic batch mode and controlled periodic refresh mode. Simulation experiment clearly shows that controlled periodic refresh mode outperforms periodic refresh mode and periodic batch mode. ; © IEEE
Internet, Trees (Mathematics), Computers, Laws And Legislation
Internet, Trees (Mathematics), Computers, Laws And Legislation
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
