원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.5 No.2
2011.04
pp.75-93
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
We propose a new definition for searchable proxy re-encryption scheme (Re-PEKS), define the first known searchable proxy re-encryption scheme with a designated tester (Re-dPEKS), and then give concrete constructions of both Re-PEKS and Re-dPEKS schemes that are secure in the random oracle model, along with the proofs.
목차
Abstract
1. Introduction
1.1. Our Contributions
1.2. Paper Organization
2. Preliminaries
2.1. Properties of Re-encryption Schemes
2.2. Bilinear Maps and Complexity Assumptions
3. Bidirectional Re-PEKS Scheme
3.1. Definition
3.2. Security Model
3.3. Construction
4. Bidirectional Re-dPEKS Scheme
4.1. Definition
4.2. Security Model
4.3. Construction
4.4. Security Analysis
5. Conclusions
References
1. Introduction
1.1. Our Contributions
1.2. Paper Organization
2. Preliminaries
2.1. Properties of Re-encryption Schemes
2.2. Bilinear Maps and Complexity Assumptions
3. Bidirectional Re-PEKS Scheme
3.1. Definition
3.2. Security Model
3.3. Construction
4. Bidirectional Re-dPEKS Scheme
4.1. Definition
4.2. Security Model
4.3. Construction
4.4. Security Analysis
5. Conclusions
References
저자정보
참고문헌
자료제공 : 네이버학술정보