当前位置: X-MOL 学术Int. J. Found. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting
International Journal of Foundations of Computer Science ( IF 0.8 ) Pub Date : 2020-08-13 , DOI: 10.1142/s0129054120500252
Juyan Li 1, 2 , Chunguang Ma 3, 4 , Zhen Gu 1
Affiliation  

Proxy Re-Encryption (PRE) is a cryptographic primitive that allows a proxy to turn an Alice’s ciphertext into a Bob’s ciphertext on the same plaintext. All of the PRE schemes are public key encryption and semantic security. Deterministic Public Key Encryption (D-PKE) provides an alternative to randomized public key encryption in various scenarios where the latter exhibits inherent drawbacks. In this paper, we construct the first multi-use unidirectional D-PRE scheme from Lattices in the auxiliary-input setting. We also prove that it is PRIV1-INDr secure in the standard model based on the LWR. Finally, an identity-based D-PRE is obtained from the basic construction.

中文翻译:

辅助输入设置中格的多用途确定性公钥代理重加密

代理重加密 (PRE) 是一种密码原语,它允许代理在相同的明文上将 Alice 的密文转换为 Bob 的密文。所有的 PRE 方案都是公钥加密和语义安全。确定性公钥加密 (D-PKE) 在随机公钥加密存在固有缺陷的各种场景中提供了一种替代方案。在本文中,我们在辅助输入设置中从 Lattices 构造了第一个多用途单向 D-PRE 方案。我们还证明了它在基于 LWR 的标准模型中是 PRIV1-INDr 安全的。最后,从基本构造中得到一个基于身份的 D-PRE。
更新日期:2020-08-13
down
wechat
bug