当前位置: X-MOL 学术Cybersecurity › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
(Identity-based) dual receiver encryption from lattice-based programmable hash functions with high min-entropy
Cybersecurity ( IF 3.9 ) Pub Date : 2019-06-13 , DOI: 10.1186/s42400-019-0034-y
Yanyan Liu , Daode Zhang , Yi Deng , Bao Li

AbstractDual receiver encryption (DRE) is an important cryptographic primitive introduced by Diament et al. at CCS’04, which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext. This primitive is quite useful in designing combined public key cryptosystems and denial of service attack-resilient protocols. In this paper, we obtain some results as follows. Using weak lattice-based programmable hash functions (wLPHF) with high min-entropy (Crypto’16), we give a generic IND-CCA secure DRE construction in the standard model. Furthermore, we get a concrete DRE scheme by instantiating a concrete wLPHF with high min-entropy.For DRE notion in the identity-based setting, identity-based DRE (IB-DRE), basing on lattice-based programmable hash functions (LPHF) with high min-entropy, we give a framework of IND-ID-CPA secure IB-DRE construction in the standard model. When instantiating with concrete LPHFs with high min-entropy, we obtain five concrete IB-DRE schemes.

中文翻译:

(基于身份的)双接收器加密来自具有高最小熵的基于格的可编程散列函数

摘要双接收器加密(DRE)是 Diament 等人引入的一种重要的密码原语。在CCS'04,它允许两个独立的接收器解密相同的密文以获得相同的明文。这个原语在设计组合公钥密码系统和拒绝服务攻击弹性协议时非常有用。在本文中,我们获得了以下一些结果。使用具有高最小熵 (Crypto'16) 的弱基于格的可编程散列函数 (wLPHF),我们在标准模型中给出了通用的 IND-CCA 安全 DRE 构造。此外,我们通过实例化具有高最小熵的具体 wLPHF 来获得具体的 DRE 方案。 对于基于身份设置中的 DRE 概念,基于身份的 DRE (IB-DRE),基于基于格的可编程散列函数 (LPHF)具有高最小熵,我们在标准模型中给出了 IND-ID-CPA 安全 IB-DRE 构建的框架。当使用具有高最小熵的具体 LPHF 进行实例化时,我们获得了五种具体的 IB-DRE 方案。
更新日期:2019-06-13
down
wechat
bug