Secret Sharing Member Expansion Protocol Based on ECC

摘要: The protocols for member expansion in secret sharing schemes are very useful key management dynamic topology networks. In order to reduce the computation complexity of existed schemes, a new protocol is proposed based on problem elliptic curve discrete logarithm. This paper exam- ines fifteen most recent patens that were awarded area sharing. Unlike traditional detailed patent reviews focused applying simple method, has following merits: 1) there no trust center ; 2) only requesting broadcast 21 t + times generate sub-secret participant and can verify truth sub-secret; 3) old participants by non- interactive zero-knowledge proof protocol; 4) generation stage, not sub-secrets but also secure. Compared protocols, lower computational less communications. Therefore, higher performance suit- able resource-constrained terminals