Short Digital Signatures and ID-KEMs via Truncation Collision Resistance-猫眼课题宝

DOI：

10.1007/978-3-030-03329-3_8

发表时间：

2018-12

期刊：

影响因子：

通讯作者：

中科院分区：

其他

文献类型：

作者：

Tibor Jager;Rafael Kurek

截断冲突抵抗性是一个简单的非交互式复杂性假设，对于SHA-3等标准加密哈希函数来说似乎非常合理。我们描述了如何利用这一假设来获得标准模型的公钥密码系统，以前似乎需要一个可编程的随机预言机的建设。这包括基于身份的密钥封装机制（ID-KEM）和双线性群上的数字签名的第一个构造，具有完全自适应安全性，没有随机预言机，其中密文或签名仅由素数阶群的单个元素组成。我们还描述了一个通用的建设ID-KEM与完全自适应安全的计划，具有非常弱的安全性（“选择性和非自适应的选择ID安全”），和类似的通用数字签名的建设。

Truncation collision resistanceis a simple non-interactive complexity assumption that seems very plausible for standard cryptographic hash functions like SHA-3. We describe how this assumption can be leveraged to obtain standard-model constructions of public-key cryptosystems that previously seemed to require a programmable random oracle. This includes the first constructions of identity-based key encapsulation mechanisms (ID-KEMs) and digital signatures over bilinear groups with full adaptive security and without random oracles, where a ciphertext or signature consists of only a single element of a prime-order group. We also describe a generic construction of ID-KEMs with full adaptive security from a scheme with very weak security (“selective and non-adaptive chosen-ID security”), and a similar generic construction for digital signatures.

Short Digital Signatures and ID-KEMs via Truncation Collision Resistance

文献摘要

相似文献