Certificateless Homomorphic Signature Scheme for Network Coding

Certificateless Homomorphic Signature Scheme for Network Coding
复制标题

网络编码的无证书同态签名方案

DOI:
10.1109/tnet.2020.3013902
复制
发表时间:
2020-12-01
影响因子:
3.7
通讯作者:
Xue, Rui
Xue, Rui
中科院分区:
计算机科学2区
文献类型:
--
作者:
Chang, Jinyong;Ji, Yanyan;Xue, Rui

文献摘要

被引文献

相似文献

同态签名是一种非常重要的公钥认证技术,用于网络编码中抵御污染攻击。作为一个公钥密码原语,它也遇到了同样的问题,即如何确认某个公钥$pk$与其所有者的身份$ID$之间的关系。在分布式网络编码环境下,中间节点和目的节点需要使用源节点S的公钥来验证矢量签名对的有效性。因此,S及其相应公钥的绑定变得至关重要。流行的和传统的解决方案是基于由可信的证书颁发机构(CA)中心颁发的证书。然而,证书的生成和管理极其繁琐。因此,在最近的工作中,Lin等人提出了一种新的基于身份的同态签名概念,旨在避免使用证书。但密钥托管问题是不可避免的基于身份的原语。在这篇文章中,我们提出了另一个新的概念(网络编码):无证书同态签名(CLHS),这是上述两种技术的折衷。特别地,我们首先描述了无证书同态签名的定义和安全模型。然后基于双线性映射和计算Diffie-Hellman(CDH)假设,给出了一个具体的实现方案,并详细分析了其安全性。最后,通过性能分析说明了本文的结构是可行的。
Homomorphic signature is an extremely important public key authentication technique for network coding to defend against pollution attacks. As a public key cryptographic primitive, it also encounters the same problem of how to confirm the relationship between some public key $pk$ and the identity $ID$ of its owner. In the setting of distributed network coding, the intermediate and destination nodes need to use the public key of source node S to check the validity of vector-signature pairs. Therefore, the binding of S and its corresponding public key becomes crucial. The popular and traditional solution is based on certificates which are issued by a trusted certification authority (CA) center. However, the generation and management of certificates is extremely cumbersome. Hence, in recent work, Lin et al. proposed a new notion of identity-based homomorphic signature, which intends to avoid using certificates. But the key escrow problem is inevitable for identity-based primitives. In this article, we propose another new notion (for network coding): certificateless homomorphic signature (CLHS), which is a compromise for the above two techniques. In particular, we first describe the definition and security model of certificateless homomorphic signature. Then based on bilinear map and the computational Diffie-Hellman (CDH) assumption, give a concrete implementation and detailedly analyze its security. Finally, performance analysis illustrates that our construction is practical.