100 likes | 112 Views
This paper discusses the weaknesses of Tseng-Jan's key distribution protocol and proposes an improved version with added verification phase to enhance security. The protocol uses prime numbers, generators, identity keys, and public keys for secure key distribution. The weaknesses of the original protocol are addressed, and the improved version allows for authentication of the conference chairperson.
E N D
Security of Tseng-Jan’s conference key distribution system Source:Applied Mathematics and Computation,167(2005),pp. 833-839 Author:Eun-Kyung Ryu, Jae-Yuel Im and Kee-Young Yoo Speaker:Shih-Chang Chang Date:2005/12/28
Outline • Tseng-Jan’s protocol • Weakness of Tseng-Jan’s protocol • Improved the protocol • Conclusion
Tseng-Jan’s protocol • System setup 1.p is a large prime number 2.q is a prime number,q|p-1 3.g is a generator with order q in GF(p) 4.IDi is the identity of Ui 5.xi is a secret key 6.yi is a public key,
Tseng-Jan’s protocol (cont.) Conference key distribution phase Uc Broadcasts {A,B,T,cn-1,cn-2,…,c1,c0}
Tseng-Jan’s protocol (cont.) Conference key recovery phase Ui
Weakness of Tseng-Jan’s protocol The adversary Intercept M={A,B,T,cn-1,cn-2,…,c1,c0} And Broadcasts M’={A,B,T,cn-1’,cn-2’,…,c1’,c0’} All users cannot share the correct conference key CK
Improved the protocol Conference key distribution phase Uc Broadcasts {A,B,T,cn-1,cn-2,…,c1,c0}
Improved the protocol (cont.) Conference key recovery phase Ui
Improved the protocol (cont.) Conference key verification phase Ui Users can authenticate the conference chairperson
Conclusion • Proposed a simple and promising remedy to such a problem by adding the verification phase