TY - GEN
T1 - CCA-secure type-based proxy re-encryption with Invisible Proxy
AU - Jia, Xiaoqi
AU - Shao, Jun
AU - Jing, Jiwu
AU - Liu, Peng
PY - 2010/11/19
Y1 - 2010/11/19
N2 - Proxy re-encryption is a useful cryptographic primitive, which allows a proxy to transform a ciphertext for Alice to another ciphertext of the same plaintext for Bob. Type-based proxy re-encryption is a specific kind of proxy re-encryption, where the proxy is restricted to transform only a subset of Alice's ciphertexts. This restriction is very useful in the situation where the fine-grained transformation is required. Some applications of type-based proxy re-encryption require that the underlying scheme simultaneously achieves CCA Security and Invisible Proxy. However, to the best of our knowledge, no such scheme has been proposed. In this paper, we propose the first type-based proxy re-encryption scheme that satisfies both requirements. The CCA security proof of our proposal is given in the random oracle model based on the decisional bilinear Diffie-Hellman (DBDH) assumption, extended decisional bilinear Diffie-Hellman inversion (eDBDHI) assumption, and extended decisional linear (eDL) assumption. Furthermore, our proposal holds the invisible proxy requirement unconditionally.
AB - Proxy re-encryption is a useful cryptographic primitive, which allows a proxy to transform a ciphertext for Alice to another ciphertext of the same plaintext for Bob. Type-based proxy re-encryption is a specific kind of proxy re-encryption, where the proxy is restricted to transform only a subset of Alice's ciphertexts. This restriction is very useful in the situation where the fine-grained transformation is required. Some applications of type-based proxy re-encryption require that the underlying scheme simultaneously achieves CCA Security and Invisible Proxy. However, to the best of our knowledge, no such scheme has been proposed. In this paper, we propose the first type-based proxy re-encryption scheme that satisfies both requirements. The CCA security proof of our proposal is given in the random oracle model based on the decisional bilinear Diffie-Hellman (DBDH) assumption, extended decisional bilinear Diffie-Hellman inversion (eDBDHI) assumption, and extended decisional linear (eDL) assumption. Furthermore, our proposal holds the invisible proxy requirement unconditionally.
UR - http://www.scopus.com/inward/record.url?scp=78249237546&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78249237546&partnerID=8YFLogxK
U2 - 10.1109/CIT.2010.234
DO - 10.1109/CIT.2010.234
M3 - Conference contribution
AN - SCOPUS:78249237546
SN - 9780769541082
T3 - Proceedings - 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, ScalCom-2010
SP - 1299
EP - 1305
BT - Proceedings - 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, ScalCom-2010
T2 - 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010
Y2 - 29 June 2010 through 1 July 2010
ER -