※ 기관로그인 시 무료 이용이 가능합니다.
※ 학술발표대회집, 워크숍 자료집 중 4페이지 이내 논문은 '요약'만 제공되는 경우가 있으니, 구매 전에 간행물명, 페이지 수 확인 부탁 드립니다.
3,000원
원문정보
초록
영어
The primitive of Identity-Based Broadcast Encryption allows a sender to distribute session keys or messages for a dynamically changing set of receivers using the receiver's identity as a public key. We already know that the trade-off exists the efficiency between the public parameter size and the ciphertext size. So, if the ciphertext size is O(1) , then the public parameter size may be O(n) . Some of IBBE scheme take the public parameters as input in decryption phase. Thus, a decryption device (or client) has to store the public parameters or receive it. This means that a decryption device (or client) has to have the proper size storage. Recently, delerable proposed an IBBE which have the O(1) size ciphertexts and the O(n) size public parameters. In this paper, we present an IBBE scheme. In our construction the ciphertext size and the public parameter size are sub-linear in the total number of receivers, and the private key size is constant.
목차
Abstract I. Introduction 1. Our Contribution 2. Organization II. Preliminaries 1. Identity-Based Broadcast Encryption 2. Bilinear Pairing 3. Correctness IV. Conclusion 참고문헌
키워드
Identity-Based CryptographyBroadcast Encryption
저자
김기탁 [ Ki Tak Kim | 고려대학교 정보경영공학 전문대학원 석사과정 재학중 ]
책임저자
박종환 [ Jong Hwan Park | 고려대학교 정보경영공학 전문대학원 박사과정 수료. ]