当前位置: X-MOL 学术arXiv.cs.CR › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Puncturable Encryption: A Generic Construction from Delegatable Fully Key-Homomorphic Encryption
arXiv - CS - Cryptography and Security Pub Date : 2020-07-13 , DOI: arxiv-2007.06353
Willy Susilo, Dung Hoang Duong, Huy Quoc Le, Josef Pieprzyk

Puncturable encryption (PE), proposed by Green and Miers at IEEE S&P 2015, is a kind of public key encryption that allows recipients to revoke individual messages by repeatedly updating decryption keys without communicating with senders. PE is an essential tool for constructing many interesting applications, such as asynchronous messaging systems, forward-secret zero round-trip time protocols, public-key watermarking schemes and forward-secret proxy re-encryptions. This paper revisits PEs from the observation that the puncturing property can be implemented as efficiently computable functions. From this view, we propose a generic PE construction from the fully key-homomorphic encryption, augmented with a key delegation mechanism (DFKHE) from Boneh et al. at Eurocrypt 2014. We show that our PE construction enjoys the selective security under chosen plaintext attacks (that can be converted into the adaptive security with some efficiency loss) from that of DFKHE in the standard model. Basing on the framework, we obtain the first post-quantum secure PE instantiation that is based on the learning with errors problem, selective secure under chosen plaintext attacks (CPA) in the standard model. We also discuss about the ability of modification our framework to support the unbounded number of ciphertext tags inspired from the work of Brakerski and Vaikuntanathan at CRYPTO 2016.

中文翻译:

可穿透加密:来自可委托完全密钥同态加密的通用构造

可穿透加密 (PE) 由 Green 和 Miers 在 IEEE S&P 2015 上提出,是一种公钥加密,它允许接收者通过重复更新解密密钥来撤销单个消息,而无需与发送者通信。PE 是构建许多有趣应用程序的重要工具,例如异步消息传递系统、前向秘密零往返时间协议、公钥水印方案和前向秘密代理重新加密。本文从打孔特性可以作为有效的可计算函数实现的观察中重新审视 PE。从这个角度来看,我们从完全密钥同态加密提出了一个通用的 PE 构造,并增加了 Boneh 等人的密钥委托机制(DFKHE)。在 Eurocrypt 2014。我们表明,我们的 PE 构造在选择的明文攻击下享有选择性安全(可以转换为具有一些效率损失的自适应安全),而不是标准模型中的 DFKHE。基于该框架,我们获得了第一个基于错误学习问题的后量子安全PE实例,标准模型中选择明文攻击(CPA)下的选择性安全。我们还讨论了修改我们的框架以支持无限数量的密文标签的能力,灵感来自于 Brakerski 和 Vaikuntanathan 在 CRYPTO 2016 上的工作。我们获得了第一个基于错误学习问题的后量子安全 PE 实例,在标准模型中选择明文攻击 (CPA) 下的选择性安全。我们还讨论了修改我们的框架以支持无限数量的密文标签的能力,灵感来自于 Brakerski 和 Vaikuntanathan 在 CRYPTO 2016 上的工作。我们获得了第一个基于错误学习问题的后量子安全 PE 实例,在标准模型中选择明文攻击 (CPA) 下的选择性安全。我们还讨论了修改我们的框架以支持无限数量的密文标签的能力,灵感来自于 Brakerski 和 Vaikuntanathan 在 CRYPTO 2016 上的工作。
更新日期:2020-07-14
down
wechat
bug