Name
Abstract | ||
|---|---|---|
Efficient key establishment is an important problem for secure group communications. The communication and storage complexity of group key establishment problem has been studied extensively. In this paper, we propose a new group key establishment protocol whose computation complexity is significantly reduced. Instead of using classic secret sharing, the protocol only employs a linear secret sharing scheme, using Vandermonde Matrix, to distribute group key efficiently. This protocol drastically reduces the computation load of each group member and maintains at least the same security degree compared to existing schemes employing traditional secret sharing. The security strength of this scheme is evaluated in detail. Such a protocol is desirable for many wireless applications where portable devices or sensors need to reduce their computation as much as possible due to battery power limitations. This protocol provides much lower computation complexity while maintaining low and balanced communication complexity and storage complexity for secure group key establishment. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s11276-016-1223-1 | Wireless Networks |
Keywords | Field | DocType |
Wireless group key transfer, Vandermonde matrix, Linear secret sharing, Computation-efficient | Group key,Key distribution,Secure multi-party computation,Secret sharing,Wireless,Computer science,Computer network,Communication complexity,Vandermonde matrix,Computation,Distributed computing | Journal |
Volume | Issue | ISSN |
23 | 1 | 1572-8196 |
Citations | PageRank | References |
3 | 0.39 | 19 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ching-Fang Hsu | 1 | 6 | 3.47 |
| Lein Harn | 2 | 15 | 4.00 |
| Yi Mu | 3 | 2884 | 239.05 |
| Maoyuan Zhang | 4 | 14 | 1.37 |
| Xuan Zhu | 5 | 3 | 0.39 |