Institutional Repository
| PRE: Stronger security notions and efficient construction with non-interactive opening | |
| Zhang, Jiang (1); Zhang, Zhenfeng (1); Chen, Yu (3); Zhang, Zhenfeng | |
| 2014 | |
| Source | Theoretical Computer Science
 |
| ISSN | 3043975 |
| Volume | 542Pages:1-16 |
| English Abstract | 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. |
| Indexed Type | SCI ; EI |
| Keyword | Public Key Encryption Proxy Re-encryption Chosen Key Model Knowledge Of Secret Key Model Chosen-ciphertext Security Dbdh |
| Department | (1) Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China; (2) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China; (3) State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China |
| Language | 英语 |
| WOS ID | WOS:000339039900001 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16845 |
| Collection | 中国科学院软件研究所 |
| Corresponding Author | Zhang, Zhenfeng |
| Recommended Citation GB/T 7714 | Zhang, Jiang ,Zhang, Zhenfeng ,Chen, Yu ,et al. 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 ,&Zhang, Zhenfeng.(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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment