A Trusted Multi-Party Authentication Scheme Based on Proactive-ElGamal Threshold Secret Sharing System

Article Preview

Abstract:

In most existing authentication schemes users are authenticated by the server one by one which results in lower efficiency of authentication when the number of users is large. Aiming at the drawback, this paper propose an efficient trusted multi-party authentication scheme based on threshold secret sharing, the discrete logarithm problem and ElGamal cryptosystem. Using (t,n) threshold secret sharing idea, the paper propose a (t,n) threshold authentication scheme which can not only simultaneously authenticate t users satisfying some specific conditions, but also authenticate new users dynamically by distributing a new authentication key for the new user which was produced by t old users and the new user together. Finally, the security and efficiency of the proposed scheme are analyzed.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

20-24

Citation:

Online since:

November 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Li Xiao-hang,Wang Hong-xia,Zhang Wen-fang, et al. Information Security, Tsinghua University press,BEIJING, 2006.

Google Scholar

[2] Shamir A.How to share a secret. Communications of the ACM,1979,22(11): 612- 613.

DOI: 10.1145/359168.359176

Google Scholar

[3] Blakley G. Safeguarding cryptographic key. AFIPS 1979 Natl Conf,New York, USA, 1979.

Google Scholar

[4] Dong Pan, Kuang Xiao-Hui, Lu Xi-Cheng.A Non-Interactive Protocol for Member Expansion in a Secret Sharing Scheme.Journal of Software,2005,16(1):116-120.

DOI: 10.1360/jos160116e

Google Scholar

[5] Zhang Xue-zhen,Li Xiao,Luo Da-wen,et al.A New authentication scheme based on Computer Science and Software Engineering.Wuhan,China:IEEE Computer Society,2008:1028-1030.

Google Scholar

[6] Zhang Xue-zhen,Li Xiao,Luo Da-wen,et al.A New Protocol of Member Expansion in a Secret Sharing Scheme.Journal of Xihua University,2010,29(3):76-80.

Google Scholar

[7] Tian Y L,Peng C G,Zhang R P,et al.A practical publicly verifiable secret sharing scheme based on bilinear.2nd International Conference on Anti-counterfeiting,Security and Identification, 2008(ASID2008)//Guiyang,China:IEEE,2008:71-75.

DOI: 10.1109/iwasid.2008.4688348

Google Scholar

[8] Wang F,Gu L,Zheng S,et al.A novel verifiable dynamic multi policy secret sharing scheme.The 12th International Conference on Advanced Communication Technology (ICACT 2010)//Paris France:IEEE,2010: 1474-1479.

Google Scholar

[9] Li Da-wei,Yang Geng,Zhu Li.An ID Based Verifiable Secret Sharing Scheme.ACTA ELECTRONICA SINICA,2010,38(9):2059-2065.

Google Scholar

[10] Luo H, Lu S. Ubiquitous and robust authentication services for Ad Hoc wireless networks. TR-200030,Department of Computer Science, UCLA, 2000.

Google Scholar

[11] Wong TM, Wang CX, Wing JM. Verifiable secret redistribution for archive systems. In: Proc. of the 1st Int'l Security in StorageWorkshop.2002.

Google Scholar

[12] ELGAMAL T.A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans on IT,1985,31(4):469-472.

DOI: 10.1109/tit.1985.1057074

Google Scholar

[13] Pedersen TP. A threshold cryptosystem without a trusted party//Proc.of the Eurocrpt 1991. LNCS 547. Berlin:Springer-Verlag,1991.522- 526.

Google Scholar

[14] Takaragi K,Miyazaki K.A threshold digital signature issuing scheme without secret communication//Proc. of the IEEE Conf.1998.

Google Scholar