한국통신학회논문지 (The Journal of Korean Institute of Communications and Information Sciences)

  • 제31권2C호
  • /
  • Pages.200-207
  • /
  • 2006
  • /
  • 1226-4717(pISSN)
  • /
  • 2287-3880(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

디지털 유료 방송시스템에 적합한 키 관리 모델에 관한 연구

A Study on Efficient Key Management Model for Digital Pay-TV System

  • 양형규 (강남대학교 컴퓨터미디어공학부)
  • 발행 : 2006.02.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

최근 들어, 정보통신 기술의 발달과 함께 디지털 방송 기술이 주목을 받으면서 제공되는 컨텐츠들에 대한 보호의 중요성이 증대되고 있다. 하지만, 이러한 여러 가지 디지털 방송 서비스의 활성화를 위해서는 방송 컨텐츠의 보호, 송수신자간의 상호 인증 등 여러 가지 보안 서비스가 제공되어야 한다. 그러므로 본 논문에서는 기존의 디지털 방송 시스템의 안전성 및 효율성을 분석하고, 디지털 유료 방송 시스템에 적합한 키 관리 모델을 제안한다.

Recently, with the development of information and communication technology, digital pay-TV technology is paid attention. So the Protection of the provided contents is becoming more important. However, in order to encourage an active based on digital TV, the contents and information sent and received respectively by the broadcaster and the subscriber must be protected. Therefore, in this paper, I analyze the requirements to protect the digital contents, the security and efficiency of the previous digital pay-TV system model. Then I proposed a key management model for digital pay-TV system.

키워드

참고문헌

  1. Arvind Narayanan, C. Paudu Pangan, Kwangjo Kim: Practical Pay-TVSchemes. ACISP 2003, LNCS 2727, pp.192-203, 2003
  2. A.K Lenstra and E.R. Verheul: Selecting Cryptographic Keys, Journal of Cryptology, 1999
  3. T.Matthews, Suggestions for Random Number Generation in Software RSA Laboratories' Bulletin no.1, 1996
  4. M. Burmester and Y. Desmedt: A secure and efficient conference key distribution system Eurocrypt'94, LNCS 950, pp.275-286, 1994
  5. C. Blundo and A. Cresti: Space requirements for broadcast encryption. In Advances in Cryptology, Eurocrypt' 94 LNCS 950, pp.287-298, 1994
  6. D.A. Agarwal, O. Chevassut, M.R. Thompson, and G. Tsudik: An Integrated Solution for Secure Group Communication in Wide-Area Networks. In Proc. of 6th IEEE Symposium on Computers and Communications, pp.22-28, 2001
  7. Y. Amir, Y. Kim, C. Nita-Rotaru, and G. Tsudik: On the Performance of Group Key Agreement Protocols. In Proc. of 22nd IEEE International Conference on Distributed Computing Systems, pp.463-464, 2002
  8. G. Ateniese, M. Steiner, and G. Tsudik: New multiparty authentication services and key agreement protocols. IEEE Journal on Selected Areas in Communications, Vol.18, no.4, pp.628-639, April 2000 https://doi.org/10.1109/49.839937
  9. K. Becker, and U. Wille: Communication complexity of group key distribution. In Proc. of 5th ACM Conf. on Computer and Communications Security, pp.1-6, 1998
  10. M. Bellare, D. Pointcheval, and P. Rogaway: Authenticated key exchange secure against dictionary attacks, Eurocrypt'00, LNCS1807, pp.139-155, 2000
  11. M. Bellare and P. Rogaway: Entity authentication and key distribution. Advances in Cryptology, Crypto'93, LNCS 773, pp.232-249, 1993
  12. M. Bellare and P. Rogaway: Random oracles are practical: A paradigm for designing efficient protocols. In Proc. of 1st ACM Conf. on Computer and Communications Security (CCS'93), pp.62-73, 1993
  13. M. Bellare and P. Rogaway: Provably secure session key distribution the three party case. In Proc. of 27th ACM Symposium on the Theory of Computing (STOC), pp.57-66, 1995
  14. E. Biham, D. Boneh, and O. Reingold: Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring. Information Processing Letters (IPL), Vol.70, no.2, pp.83-87, 1999 https://doi.org/10.1016/S0020-0190(99)00047-2
  15. C. Boyd and J.M.G. Nieto: Round-optimal contributory conference key agreement. PKC 2003, LNCS 2567, pp.161-174, 2003
  16. E. Bresson and D. Catalano: Constant round authenticated group key agreement via distributed computation. Proc. 7th International Workshop on Practice and Theory in Public Key Cryptography (PKC'04), LNCS 2947, pp.115-129, 2004
  17. E. Bresson, O. Chevassut, and D. Point-cheval: Provably authenticated group DiffieHellman key exchange the dynamic case. Asiacrypt'01, LNCS 2248, pp.290-309, 2001
  18. E. Bresson, O. Chevassut, and D. Pointcheval: Dynamic group Diffie-Hellman key exchange under standard assumptions. Eurocrypt'02, LNCS 2332, pp.321-336, 2002
  19. E. Bresson, O. Chevassut, and D. Pointcheval: Group Diffie-Hellman key exchange secure against dictionary attacks. Asiacrypt'02, LNCS 2501, pp.497-514, 2002
  20. E. Bresson, O. Chevassut, D. Pointcheval, and J.-J. Quisquater: Provably authenticated group Diffie-Hellman key exchange. In Proc. of 8th ACM Conf. on Computer and Communications Security, pp.255-264, 2001
  21. O. Pereira and J.-J. Quisquater: A security analysis of the Cliques protocols suites. Proc. 14th IEEE Computer Security Foundations Workshop, pp.73-81, June 2001
  22. M. Steiner, G. Tsudik, and M. Waidner: Diffie-Hellman key distribution extended to group communication. Proc. of 3rd ACM Conf. on Computer and Communications Security (CCS'96), pp.31-37, 1996