지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학위논문
- 저자정보
- 지도교수
- 李東勳
- 발행연도
- 2014
- 저작권
- 고려대학교 논문은 저작권에 의해 보호받습니다.
이용수0
이 논문의 연구 히스토리 (2)
- 이 논문의 후속연구가 궁금하신가요?
- 연관 학술논문 또는 학술발표를 통해 보다 발전된 연구결과를 확인하실 수 있습니다.
- 이 논문의 연구 히스토리 확인하기
초록· 키워드
오류제보하기
In a Broadcast Encryption System, a sender sends an encrypted message to a large set of receivers at once over an insecure channel and it enables only users in a target set to decrypt the message with their private keys. In 2005, Boneh et al. proposed a fully collusion-resistant public key broadcast encryption system in which the ciphertext and the privatekey sizes are constant. In general, pairing-based broadcast encryption systems are more efficient in bandwidth and storing aspects than non-pairing based broadcast encryption systems, however, they require many computational costs that resource-constrained devices are not suitable to be applied. In this paper, we propose a broadcast encryption scheme that user can decrypt a ciphertext more efficiently. The scheme is based on Boneh et al.’s scheme. More precisely, it reduces receiver’s computational costs by delegating pairing computations and other computation where O(n) size public key are used to. Furthermore, the scheme enables a user to check if the proxy server compute correctly. We show that our scheme is secure against selective IND-RCCA adversaries under the n-BDHE assumption.
목차
1. Introduction1.1 Overview1.2 Related Work1.3 Contribution2. Preliminaries2.1 Definition of BESDD Scheme2.2 Security Model of BESDD Scheme2.3 Bilinear Maps2.4 l-BDHE Assmptions3. BGW Scheme3.1 BGW Scheme3.2 Security Proof of the BGW Scheme4. CPA-Secure Construction4.1 Construction4.2 Security Proof5. RCCA-Secure Construction5.1 Construction5.1 Security Proof6. Analysis7. Conclusion
최근 본 자료
댓글(0)
0