Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
复制标题
DOI：
10.1007/978-3-642-13013-7_1
复制
发表时间：
2010-05
期刊：
影响因子：
--
通讯作者：
Kristiyan Haralambiev;Tibor Jager;Eike Kiltz;V. Shoup
中科院分区：
文献类型：
--
作者：
Kristiyan Haralambiev;Tibor Jager;Eike Kiltz;V. Shoup
本文提出了在标准模型下，在计算diffie - hellman假设下可证明安全的实用选择密文安全公钥加密系统。我们的方案在概念上比以前的结构更简单，更有效。我们还表明，在双线性组中，公钥的大小可以从2个组元素缩小到2个组元素，其中是安全参数。
This paper proposes practical chosen-ciphertext secure public-key encryption systems that are provably secure under thecomputationalDiffie-Hellman assumption, in the standard model. Our schemes are conceptually simpler and more efficient than previous constructions. We also show that in bilinear groups the size of the public-key can be shrunk fromntogroup elements, wherenis the security parameter.