A New Anonymous Conference Authentication Scheme Based on Knapsack Problem

Bin Wang, Yunfei Guo, Jia Zhou, Jianhui Zhang · 2009

Considered the especial requirements to protect the identity of the user who join a networks conference, a secure and anonymous conference authentication scheme was proposed which is based on 0/1 Knapsack problem. The security of authentication and anonymity was analyzed in detail. It is showed that the proposed scheme could not only achieve authentication securely but also has a secure anonymity, and could achieve the secure requirements of the network. Moreover, the scheme is simple and efficient, and could be applied to the authentication in the network.

Read the paper · More papers on PaperTik