PRE: Stronger security notions and efficient construction with non-interactive opening

ISCAS OpenIR

	PRE: Stronger security notions and efficient construction with non-interactive opening
	Zhang, Jiang (1); Zhang, Zhenfeng (1); Chen, Yu (3); Zhang, Zhenfeng
	2014
发表期刊	Theoretical Computer Science
ISSN	3043975
卷号	542 页码:1-16
摘要	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
关键词	Public Key Encryption Proxy Re-encryption Chosen Key Model Knowledge Of Secret Key Model Chosen-ciphertext Security Dbdh
部门归属	(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
语种	英语
WOS记录号	WOS:000339039900001
引用统计
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16845
专题	中国科学院软件研究所
通讯作者	Zhang, Zhenfeng
推荐引用方式 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.