Secure Network Coding Over the Integers

Secure Network Coding Over the Integers
复制标题

DOI:
10.1007/978-3-642-13013-7_9
复制
发表时间:
2010-05
期刊:
--
影响因子:
--
通讯作者:
R. Gennaro;Jonathan Katz;H. Krawczyk;T. Rabin
R. Gennaro;Jonathan Katz;H. Krawczyk;T. Rabin
中科院分区:
其他
文献类型:
--
作者:
R. Gennaro;Jonathan Katz;H. Krawczyk;T. Rabin

文献摘要

被引文献

相似文献

网络编码提供了在没有任何集中控制的情况下增加吞吐量和改善鲁棒性的潜力。不幸的是,网络编码极易受到“污染攻击”的影响,在这种攻击中,恶意节点不正确地修改数据包,以阻止接收方恢复消息;使用标准的端到端加密身份验证无法阻止此类攻击,因为网络编码要求中间节点修改传输中的数据包。近年来,利用同态哈希和同态签名开发了专门的“网络编码签名”来解决这个问题。我们在几个方面对这一领域做出了贡献:我们展示了基于RSA假设的第一个同态签名方案(在随机oracle模型中)。我们给出了一个比现有方案更有效的同态哈希方案,并基于因式分解的硬度(在标准模型中)产生网络编码签名。我们描述了现有方案的变体,这些方案减少了中等规模网络的通信开销,并提高了计算效率(在某些情况下非常显着-例如,我们在中间节点上实现了20倍的签名生成加速)。我们的技术基础是一种改进的随机线性网络编码方法,而不是在场上的向量空间中工作,我们在整数(具有小系数)的模块中工作。
Network coding offers the potential to increase throughput and improve robustness without any centralized control. Unfortunately, network coding is highly susceptible to “pollution attacks” in which malicious nodes modify packets improperly so as to prevent message recovery at the recipient(s); such attacks cannot be prevented using standard end-to-end cryptographic authentication because network coding mandates that intermediate nodes modify data packets in transit.Specialized “network coding signatures” addressing this problem have been developed in recent years using homomorphic hashing and homomorphic signatures. We contribute to this area in several ways:We show the first homomorphic signature scheme based on the RSA assumption (in the random oracle model).We give a homomorphic hashing scheme that is more efficient than existing schemes, and which leads to network coding signatures based on the hardness of factoring (in the standard model).We describe variants of existing schemes that reduce the communication overhead for moderate-size networks, and improve computational efficiency (in some cases quite dramatically – e.g., we achieve a 20-fold speedup in signature generation at intermediate nodes).Underlying our techniques is a modified approach to random linear network coding where instead of working in a vector space over afield, we work in a module over theintegers(with small coefficients).