최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기KSII Transactions on internet and information systems : TIIS, v.7 no.1, 2013년, pp.149 - 165
Hong, Sunghyuck (Division of Information and Communication, Baekseok University) , Lee, Sungjin (Division of Information and Communication, Baekseok University)
Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An...
Amir, Y., Kim, Y., Nita-Rotaru, C., and Tsudik, G. "On the Performance of Group Key Agreement Protocols", ACM trans. on information and system security, vol. 7, no. 3, pp. 457- 488, 2004.
Bresson, E., Chevassut, O. "Provably authenticated group Diffie-Hellman key exchange", In Proc. of the 8th ACM CCS'01, 2001.
Tripathi, S.; Biswas, G.P.; , "Design of efficient ternary-tree based group key agreement protocol for dynamic groups," Communication Systems and Networks and Workshops, 2009. COMSNETS 2009. First International , vol., no., pp.1-6, 5-10 Jan. 2009.
Choie, Y., Jeong, E., and Lee, E. "Efficient identity-based authenticated key agreement protocol from pairings," Applied Mathematics and Computation, vol. 162, no. 1, pp. 179-188, 2005. .
Kaufman, C., Perlman, R, Speciner, M., "Network security: private communication in a public world, second edition," Prentice Hall Press Upper Saddle River, 2002.
Diffie W. and Hellman, M. E. "New directions in cryptography," IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644-654, 1976. .
Fekete, A., Lynch, N., and Shvartsman, A. "Specifying and using a partitionable group communication service," In ACM PODC '97, 1997.
Hong, S. and Lopez-Benitez, N. "Enhanced Group Key Generation Algorithm," 10th IEEE/IFIP Network Operations and Management Symposium, 1-4, 2006. .
Katz, J. and Yung, M. "Scalable Protocols for Authenticated Group Key Exchange," Journal of Cryptology, vol. 20, no. 1, pp. 85-113, 2006.
Kim, Y. Group key agreement: theory and practice, Ph.D. dissertation, 2002.
Kim, Y.; Perrig, A.; Tsudik, G.; , "Group key agreement efficient in communication," Computers, IEEE Transactions on , vol.53, no.7, pp. 905- 921, July 2004.
Kim, Y., Perrig, A., and Tsudik, G. "Tree-based group key agreement," ACM Transaction on Information and System Security, 2004.
Lenstra, A. K. and Verheul, E. R. "Selecting cryptographic key sizes," Journal of Cryptology, vol. 14, no. 4, pp. 255-293, 2001.
Steiner, M., Tsudik, G., and Waidner, M. "Key agreement in dynamic peer groups," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 769-780, 2000.
Wong, C., Gouda, M., and Lam S. Secure group communications using key graphs, IEEE / ACM Transactions on Networking, vol. 8, no. 1, pp. 16-30, 2000.
Mike Burmester and Yvo Desmedt, "A secure and efficient conference key distribution system", Advances in Cryptology - EUROCRYPT '94, number 950 in Lecture Notes in Computer Science. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1995.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
오픈액세스 학술지에 출판된 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.