A New Anonymous Conference Authentication Scheme Based on Knapsack Problem

Author

Wang, Bin ; Guo, Yun-fei ; Zhou, Jia ; Zhang, Jian-hui

Author_Institution

Inf. Eng. Univ., Zhengzhou

Volume

2

fYear

2009

fDate

25-26 April 2009

Firstpage

512

Lastpage

515

Abstract

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.

Keywords

cryptographic protocols; knapsack problems; telecommunication security; 0/1 knapsack problem; anonymous conference authentication; cryptographic protocol; network conference; secure anonymity; user identity protection; Authentication; Computer networks; Cryptographic protocols; Cryptography; Electronic mail; Information security; Media Access Protocol; Privacy; Protection; Wireless communication; anonymous; conference; cryptographic;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks Security, Wireless Communications and Trusted Computing, 2009. NSWCTC '09. International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-1-4244-4223-2

Type

conf

DOI

10.1109/NSWCTC.2009.174

Filename

4908518