Abstract: This paper presents a membership management scheme based on grouping in P2P network. It divides the peers into groups. Every group includes the group heads and the members. It develops an ID-based key generation scheme. It uses the symmetric polynomial to establish the key pairs for the members that reduce the interactive of the peers and enhance security. The group heads update the key periodically, it can detect the malice peers. Experimental result shows that this scheme is of high efficiency and little communication.

Key words: P2P network, membership management, symmetric function, communication key

摘要： 提出一种P2P网络中的基于分组结构的成员管理方案。对网络中的节点进行分组，每个组由组头和成员节点组成，采用基于身份的密钥生成机制，使用对称函数建立成员间的密钥对，减少节点间的交互，增强通信的安全性。组头定期更新组密钥，以防止恶意节点的破坏。实验结果表明，该方案效率较高且通信量较少。

关键词: P2P网络, 成员管理, 对称函数, 通信密钥

CLC Number: 

• TP309