PRE: Stronger security notions and efficient construction with non-interactive opening | |
Zhang, Jiang (1) ; Zhang, Zhenfeng (1) ; Chen, Yu (3) | |
刊名 | Theoretical Computer Science |
2014 | |
卷号 | 542页码:1-16 |
关键词 | Public key encryption Proxy re-encryption Chosen key model Knowledge of secret key model Chosen-ciphertext security DBDH |
ISSN号 | 3043975 |
通讯作者 | Zhang, Zhenfeng |
中文摘要 | In a proxy re-encryption (PRE) scheme, a proxy is given a re-encryption key and has the ability to translate a ciphertext under one key into a ciphertext of the same message under a different key, without learning anything about the message encrypted under either key. This paper first shows that the chosen key (CK) model which allows the adversary to adaptively choose public keys for malicious users, is strictly stronger than the knowledge of secret key models (KOSK) that most of previous PREs rely on. Then, the paper presents an efficient CCA secure PRE scheme in the stronger CK model based on the decisional bilinear Diffie-Hellman (DBDH) assumption without the random oracle heuristic. The paper also considers a useful property in PRE applications, namely, "non-interactive opening" and an extended scheme is given to support the property. Compared with previous schemes, the PRE scheme in this paper has a good overall performance in terms of ciphertext length, computational cost, strong and realistic security model as well as a well-studied assumption. |
英文摘要 | In a proxy re-encryption (PRE) scheme, a proxy is given a re-encryption key and has the ability to translate a ciphertext under one key into a ciphertext of the same message under a different key, without learning anything about the message encrypted under either key. This paper first shows that the chosen key (CK) model which allows the adversary to adaptively choose public keys for malicious users, is strictly stronger than the knowledge of secret key models (KOSK) that most of previous PREs rely on. Then, the paper presents an efficient CCA secure PRE scheme in the stronger CK model based on the decisional bilinear Diffie-Hellman (DBDH) assumption without the random oracle heuristic. The paper also considers a useful property in PRE applications, namely, "non-interactive opening" and an extended scheme is given to support the property. Compared with previous schemes, the PRE scheme in this paper has a good overall performance in terms of ciphertext length, computational cost, strong and realistic security model as well as a well-studied assumption. |
收录类别 | SCI ; EI |
语种 | 英语 |
WOS记录号 | WOS:000339039900001 |
公开日期 | 2014-12-16 |
内容类型 | 期刊论文 |
源URL | [http://ir.iscas.ac.cn/handle/311060/16845] |
专题 | 软件研究所_软件所图书馆_期刊论文 |
推荐引用方式 GB/T 7714 | Zhang, Jiang ,Zhang, Zhenfeng ,Chen, Yu . PRE: Stronger security notions and efficient construction with non-interactive opening[J]. Theoretical Computer Science,2014,542:1-16. |
APA | Zhang, Jiang ,Zhang, Zhenfeng ,&Chen, Yu .(2014).PRE: Stronger security notions and efficient construction with non-interactive opening.Theoretical Computer Science,542,1-16. |
MLA | Zhang, Jiang ,et al."PRE: Stronger security notions and efficient construction with non-interactive opening".Theoretical Computer Science 542(2014):1-16. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论