QQ客服 官方微博 反馈留言

	The n-Diffie-Hellman problem and its applications
	Chen, Liqun ; Chen, Yu
	2011
英文摘要	The main contributions of this paper are twofold. On the one hand, the twin Diffie-Hellman (twin DH) problem proposed by Cash, Kiltz and Shoup is extended to the n-Diffie-Hellman (n-DH) problem for an arbitrary integer n, and this new problem is shown to be at least as hard as the ordinary DH problem. Like the twin DH problem, the n-DH problem remains hard even in the presence of a decision oracle that recognizes solution to the problem. On the other hand, observe that the double-size key in the Cash et al. twin DH based encryption scheme can be replaced by two separated keys each for one entity, that results in a 2-party encryption scheme which holds the same security feature as the original scheme but removes the key redundancy. This idea is further extended to an n-party case, which is also known as n-out-of-n encryption. As examples, a variant of ElGamal encryption and a variant of Boneh-Franklin IBE have been presented; both of them have proved to be CCA secure under the computational DH assumption and the computational bilinear Diffie-Hellman (BDH) assumption respectively, in the random oracle model. The two schemes are efficient, due partially to the size of their ciphertext, which is independent to the value n. ? 2011 Springer-Verlag.; EI; 0
语种	英语
DOI标识	10.1007/978-3-642-24861-0_9
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/328684]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Chen, Liqun,Chen, Yu. The n-Diffie-Hellman problem and its applications. 2011-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。