http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Interval Two-dimensional Hash Chains and Application to a DRM system
Jung, Chae-Duk,Shin, Weon,Hong, Young-Jin,Rhee, Kyung-Hyune Korea Multimedia Society 2007 멀티미디어학회논문지 Vol.10 No.12
One-way hash chains are important cryptographic primitives and have been used as building blocks of various cryptographic applications. Advantages of one-way hash chains are their simplicity and efficiency for generation based on low-powered processors with short time. However, a drawback of one-way hash chains is their difficulty of control to compute interval values of one-way hash chains. That is, when hash values in one-way hash chain are used as encryption keys, if one hash value is compromised, then the attacker can compute other encryption keys from the compromised hash value. Therefore, direct use of one-way hash chains as encryption keys is limited to many cryptographic applications, such as pay per view system and DRM system. In this paper, we propose a new concept which is called interval hash chain using a hash function. In particular, proposed hash chains are made for only computing interval hash values by using two different one-way hash chains. The proposed scheme can be applied to contents encryption scheme for grading and partially usable contents in DRM system.
A Robust and Efficient Anonymous Authentication Protocol in VANETs
Jung, Chae-Duk,Sur, Chul,Park, Young-Ho,Rhee, Kyung-Hyune The Korea Institute of Information and Commucation 2009 Journal of communications and networks Vol.11 No.6
Recently, Lu et al. proposed an efficient conditional privacy preservation protocol, named ECPP, based on group signature scheme for generating anonymous certificates from roadside units (RSUs). However, ECPP does not provide unlinkability and traceability when multiple RSUs are compromised. In this paper, we make up for the limitations and propose a robust and efficient anonymous authentication protocol without loss of efficiency as compared with ECPP. Furthermore, in the proposed protocol, RSUs can issue multiple anonymous certificates to an OBU to alleviate system overheads for mutual authentication between OBUs and RSUs. In order to achieve these goals, we consider a universal re-encryption scheme and identity-based key establishment scheme as our building blocks. Several simulations are conducted to verify the efficiency and effectiveness of the proposed protocol by comparing with those of the existing ECPP.
EFFICIENT AUTHENTICATION PROTOCOL BASED ON CERTIFICATELESS SIGNATURE IN VEHICULAR AD-HOC NETWORKS
Chae-Duk Jung,Chul Sur Kyung,Hyune Rhee 한국멀티미디어학회 2006 한국멀티미디어학회 국제학술대회 Vol.2006 No.-
In this paper, we propose an efficient authentication protocol based on certificateless signature scheme, which does not need any infrastructure to deal with certification of public keys, among the vehicles in Vehicular Ad-hoc Networks. Moreover, the proposed protocol introduces the concept of interval signature key for efficiently solving the problem of certificate revocation.
A DRM SYSTEM FOR GRADING AND PARTIALLY USABLE CONTENTS BASED ON INTERVAL TWO-DIMENSIONAL HASH CHAIN
Chae-Duk Jung,Weon Shin Young,Young Jin Hong,Kyung Hyune Rhee 한국멀티미디어학회 2007 한국멀티미디어학회 국제학술대회 Vol.2007 No.-
One-way chain is an important cryptographic primitive in many security applications. Advantages of one-way chain are that can be generated by low-powered processors within milliseconds using one-way function, and processors can compute a sequence by means of starting value. However, the drawback of one-way chain is that this cannot control to compute interval values of one-way chain. That is, when hash values in one-way chain are used as encryption keys, if one hash value in one-way chain is compromised to an attacker, then the attacker can compute other encryption keys from the compromised key (hash value) using hash function. Therefore, one-way chain hardly applies to encryption scheme, such as pay per view system and DRM system. In this paper, we propose a new concept which is called interval hash chain using a hash function. In particular, proposed hash chain is made for only computing interval hash values by using two different hash chains. We then proceed to use contents encryption scheme to get grading and partial using contents in DRM system.
A Robust and Efficient Anonymous Authentication Protocol in VANETs
Chae Duk Jung,서철,박영호,이경현 한국통신학회 2009 Journal of communications and networks Vol.11 No.6
Recently, Lu et al. proposed an efficient conditional privacy preservation protocol, named ECPP, based on group signature scheme for generating anonymous certificates from roadside units (RSUs). However, ECPP does not provide unlinkability and traceability when multiple RSUs are compromised. In this paper, we make up for the limitations and propose a robust and efficient anonymous authentication protocol without loss of efficiency as compared with ECPP. Furthermore, in the proposed protocol, RSUs can issue multiple anonymous certificates to an OBU to alleviate system overheads for mutual authentication between OBUs and RSUs. In order to achieve these goals, we consider a universal re-encryption scheme and identity-based key establishment scheme as our building blocks. Several simulations are conducted to verify the efficiency and effectiveness of the proposed protocol by comparing with those of the existing ECPP.
VANET에서 프라이버시 보호를 위한 효율적인 그룹키 관리 기술
정채덕(Chae Duk Jung),서철(Chul Sur),박영호(Youngho Park),이경현(Kyung-Hyune Rhee) 한국멀티미디어학회 2008 한국멀티미디어학회 학술발표논문집 Vol.2008 No.1
최근, 전자장치들의 급격한 가격하락과 안전한 운전을 요구하는 사용자들의 증가로 자동차 내부에 네트워크를 구성하게 되었고, 이러한 추세의 일환으로 VANET(Vehicular Ad-hoc Network)이 소개되었다. 한편, VANET에서 악의적인 공격자로부터 사용자의 위치추적 공격에 대한 위협이 소개되면서, 프라이버시 보호의 필요성이 증대되었다. 최근까지 VANET에서 프라이버시를 보호하기 위한 메커니즘으로 익명 인증서기반 기술과 Mix-zone기반 기술등이 소개되었다. 기 제안된 Mix-zone기반 프라이버시 보호 기술은 그룹키 생성 단계 및 그룹키 갱신 단계에서 RSU(Road-Side Unit) 및 차량의 계산상 높은 오버헤드가 발생한다. 본 논문에서는 Mix-zone에서 효율적인 그룹키 관리 기술로서, 그룹키 생성 및 갱신 단계에서 일방향 해쉬 체인을 이용하여 RSU 및 차량의 계산상 오버헤드를 감소시키는 방안을 제안한다.
정채덕(Chae-Duk Jung),서철(Chul Sur),이경현(Kyung-Hyune Rhee) 한국멀티미디어학회 2006 한국멀티미디어학회 학술발표논문집 Vol.2006 No.2
본 논문에서는 Bilinear Paring을 사용한 효율적인 신원기반 다중 수신자 암호 기업을 제안한다. 제안 기법은 암호화 과정에서 Pairing 연산을 필요로 하지 않으며 복호화 과정에서 단 한번의 Pairing 연산만을 요구한다. 뿐만 아니라, 제안 기법을 기반으로 효율적인 스테이트리스 (stateless) 브로드캐스트 암호 기법을 제시한다.