Conference Key Agrement Protocol for Multilateral Remote Conference Employing a SBIBD Network

SBIBD 네트워크에서 다자간 원격회의를 위한 회의용 키 생성 프로토콜

  • 김성열 (울산과학대학 컴퓨터정보학부) ;
  • 김동현 (순천청암대 부동산학과)
  • Received : 2009.10.19
  • Accepted : 2009.11.20
  • Published : 2009.12.31

Abstract

A conference key agreement system is a scheme to generate a session key in a contributory manner in order to communicate with each other securely among participants. In this paper an efficient conference key agreement system is proposed by employing symmetric balanced incomplete block design(SBIBD), one class of block designs. The protocol presented not only minimizes the message overhead and message exchanging rounds but also makes every participant contribute evenly for generating a conference key. Our protocol constructs a conference key which takes modified Diffe-Helman form of ${\prod}_{i=0}^{v-1}R_i$, where v is the number of participants and $R_i$ is a random number generated from member i. In a special class of SBIBD, it takes only 3 rounds message exchange and message overhead is $O(v{\sqrt{v}})$. Our protocol can be proved as computationally difficult to calculate as discrete logarithms.

References

  1. M. Steiner, G. Tsudik, and M. Waidner, "Key agreement in dynamic peer groups", IEEE Transactions on Parallel and Distributed Systems, August 2000.
  2. Patrick P. C. Lee, John C. S. Lui and David K. Y. Yau, "Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups", IEEE International Conference on Network Protocols, 2002.
  3. M. Eltoweissy, M. Moharrum and R. Mukkamala, "Dynamic Key Management in Sensor Network", IEEE Communication Magazine, 2006
  4. I.Ingemarrson, D. T. Tang and C. K. Wong, "A conference key distribution System", IEEE Trans. Inform. Theory Vol.28, pp.714-720, 1982. https://doi.org/10.1109/TIT.1982.1056542
  5. Whit Diffie and Martin Hellman, "New Direction in cryptography", IEEE Trans Inform. Theory, Vol.22, No.6, pp.644-654, 1976. https://doi.org/10.1109/TIT.1976.1055638
  6. Burmester and Y. Desmedt, "A Secure and Eff icient Conference Key Distribution System", LNCS Vol.950, pp.275-286, 1994.
  7. M Steiner, G.Tsudik and M.Waidner, "Diffie- Hellman Key Distribution Extended to Groups", ACM CCS96, pp.31-37, 1996.
  8. M. K. Bennett, "Affine and projective geometry", Wiley & Sons, 1995.
  9. C. L. Liu, "Introduction to Combinatorial Mathamatics", McGraw-Hill, NY, pp.359-383, 1968.
  10. O. Lee, M. Anshel, and I. Chung, "Design of an efficient load balancing algorithm on distributed networks by employing symmetric balanced incomp[lete block design", IEEE Proc-Commun, Vol. 151, No.6, pp.535-538, 2004. https://doi.org/10.1049/ip-com:20040704