TY - GEN
T1 - Type-Based Proxy Re-encryption and Its Construction
AU - Tang, Qiang
N1 - 10.1007/978-3-540-89754-5_11
PY - 2008/12
Y1 - 2008/12
N2 - Recently, the concept of proxy re-encryption has been shown very useful in a number of applications, especially in enforcing access control policies. In existing proxy re-encryption schemes, the delegatee can decrypt all ciphertexts for the delegator after re-encryption by the proxy. Consequently, in order to implement fine-grained access control policies, the delegator needs to either use multiple key pairs or trust the proxy to behave honestly. In this paper, we extend this concept and propose type-based proxy re-encryption, which enables the delegator to selectively delegate his decryption right to the delegatee while only needs one key pair. As a result, type-based proxy re-encryption enables the delegator to implement fine-grained policies with one key pair without any additional trust on the proxy. We provide a security model for our concept and provide formal definitions for semantic security and ciphertext privacy which is a valuable attribute in privacy-sensitive contexts. We propose two type-based proxy re-encryption schemes: one is CPA secure with ciphertext privacy while the other is CCA secure without ciphertext privacy.
AB - Recently, the concept of proxy re-encryption has been shown very useful in a number of applications, especially in enforcing access control policies. In existing proxy re-encryption schemes, the delegatee can decrypt all ciphertexts for the delegator after re-encryption by the proxy. Consequently, in order to implement fine-grained access control policies, the delegator needs to either use multiple key pairs or trust the proxy to behave honestly. In this paper, we extend this concept and propose type-based proxy re-encryption, which enables the delegator to selectively delegate his decryption right to the delegatee while only needs one key pair. As a result, type-based proxy re-encryption enables the delegator to implement fine-grained policies with one key pair without any additional trust on the proxy. We provide a security model for our concept and provide formal definitions for semantic security and ciphertext privacy which is a valuable attribute in privacy-sensitive contexts. We propose two type-based proxy re-encryption schemes: one is CPA secure with ciphertext privacy while the other is CCA secure without ciphertext privacy.
KW - METIS-263987
KW - SCS-Cybersecurity
KW - EWI-15990
KW - IR-67860
U2 - 10.1007/978-3-540-89754-5_11
DO - 10.1007/978-3-540-89754-5_11
M3 - Conference contribution
SN - 978-3-540-89753-8
T3 - Lecture Notes in Computer Science
SP - 130
EP - 144
BT - Progress in Cryptology - INDOCRYPT 2008, 9th International Conference on Cryptology in India
PB - Springer
CY - Berlin
T2 - 9th International Conference on Cryptology, INDOCRYPT 2008
Y2 - 14 December 2008 through 17 December 2008
ER -