|
[1] S. Al-Riyami and K. Paterson,Authenticated three party key agreement protocols from pairings," Cryptology Print Archive, Report 2002/035, available at http://eprint.iacr.org/2002/035/. [2] P.S.L.M. Barreto, H.Y. Kim, B.Lynn, and M.Scott,"Efficient Algorithms for pairing-based cryptosystems," To appear in Cryptology-Crypto''2002,available at http://eprint.iacr.org/2002/008/. [3] R.Canetti and R.Rivest, "Pairing-Based Cryptography", Special Topics in Cryptograph, May 5,2004. [4] D.S. Dummit, "Abstract Algebra", Prentice-Hall, Inc,1991. [5] Diffie-Hellman, Key Agreement Method E. Rescorla June 1999. [6] 鄧安文; 密碼學-加密演算法;全華科技圖書出版.2004. [7] T.W. Hungerford, "Algebra", New York, 1974. [8] N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol. 48, PP.203-209, 1987 [9] S. Lee, Y. Kim, K. Kim, and D.H. Ryu," An Efficient Tree-based Group Key Agreement using Bilinear Map", [10] S. Mittra, "Iolus: a framework for scaclable secure multicasting," in Proceedings of ACM SIGCOMM''97, pp. 277-288, New York, 1997. [11] J.Pieprzyk, T.Hardjono, and J.Seberry, "Fundamentals of Computer Security", Springer, 2003. [12] L.M Wang and C.K Wu, "Efficient Key Agreement for Large and Dynamic Multicast Groups ", International Journal of Network Security,Vol.3, No.1, PP.8-17, July 2006
|