检索结果-内蒙古大学图书馆

21st International Conference on Advanced Communication Technology (ICACT)

作者： Wang Hongyuan China Acad Elect & Informat Technol LoongCloud Common Prod Res Inst Beijing Peoples R China

ISBN: (纸本)9791188428021

With the development of the cloud computing and big data, massive data based computing and storage have emerged as core technologies. Moreover, a key problem to ensure data availability and analysis accuracy is the data integrity which has received extensive attention. Compared to the mature solution in the batch computing, the data integrity in the stream computing did not receive due attention. However, the characters of timeliness, volatility, suddenness and disorder of big data make the data integrity in the stream computing a very difficult problem. Based on the framework of current general stream computing system, in this paper, we construct an externally data integrity tracking and verification system for the real-time tracking and analysing of the data content and processing path of each message, and the discovering of the data integrity problem. We use the common cryptographic algorithm to construct a universal data integrity tracking and verification scheme outside the stream computing system to ensure the integrity and consistency of the data. Then we give the formal security analysis in standard model, and perform simulations in cloud environment. Results show that the proposed system can verify data integrity efficiently without compromising the efficiency.

关键词： Stream computing system data integrity verification homomorphic message authentication code pseudo-random function security proof

来源：评论

学校读者我要写书评

暂无评论

Comment on "An Efficient homomorphic MAC with Small Key Size for authentication in Network Coding"

引用

IEEE TRANSACTIONS ON COMPUTERS 2015年第3期64卷 882-883页

作者： Li, Chen Chen, Le Lu, Rongxing Li, Hui Xidian Univ State Key Lab Integrated Serv Network Xian 710071 Shaanxi Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

Quite recently, Cheng and Jiang [1] designed an efficient homomorphic message authentication code (MAC) scheme for authentication in network coding, and claimed that the newly proposed scheme can achieve much higher security level with a formal security proof. However, in this comment, we will point out there exists a design flaw in their proposed scheme, leading to an inherent vulnerability, and also show an inaccuracy in their formal security proof. We hope that by identifying the design flaw, similar mistakes can be avoided in future design of homomorphic MAC authentication for network coding.

关键词： homomorphic message authentication code network coding pollution attack

来源：评论

学校读者我要写书评

暂无评论

Analysis of a homomorphic MAC-based Scheme against Tag Pollution in RLNC-Enabled Wireless Networks 20

Analysis of a Homomorphic MAC-based Scheme against Tag Pollu...

引用

IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)

作者： Esfahani, Alireza Mantas, Georgios Monteiro, Valdemar Ramantas, Kostas Datsika, Eftychia Rodriguez, Jonathan IT Campus Univ Santiago P-3810193 Aveiro Portugal IQUADRAT Barcelona 08009 Spain

ISBN: (纸本)9781467381864

Network Coding-enabled wireless networks are vulnerable to data pollution attacks where adversary nodes inject into the network polluted (i.e. corrupted) packets that prevent the destination nodes from decoding correctly. Even a small proportion of pollution can quickly propagate into other packets via re-coding, occurred at the intermediate nodes, and lead to resource waste. Therefore, during the past few years, several solutions have been proposed to provide resistance against data pollution attacks. One of the most well-known solutions is homomorphic message authentication code (HMAC). However, HMAC is susceptible to a new type of pollution attacks, called tag pollution attacks, in which a malicious node randomly modifies MAC tags appended at the end of the transmitted packets. To address this issue, we have recently proposed an HMAC-based scheme making use of two types of MAC tags to provide resistance against both data pollution attacks and tag pollution attacks. In this paper, we steer our focus on improving the resistance of our proposed scheme against tag pollution attacks by decreasing the number of MACs. Finally, we analyze the impact of the total number of MACs on the bandwidth overhead of the proposed scheme.

关键词： Network coding homomorphic message authentication code data pollution attack tag pollution attack

来源：评论

学校读者我要写书评

暂无评论

A Null Space-based MAC Scheme against Pollution Attacks to Random Linear Network Coding

A Null Space-based MAC Scheme against Pollution Attacks to R...

引用

IEEE International Conference on Communications (ICC)

作者： Esfahani, Alireza Mantas, Georgios Rodriguez, Jonathan Nascimento, Alberto Neves, Jose Carlos IT Aveiro Portugal

ISBN: (纸本)9781467363051

Network Coding has significantly shown the achievable throughput and robustness in wireless Networks. However, network coding-enabled networks are susceptible to pollution attacks where a small number of polluted messages will propagate due to recoding and corrupt bunches of legitimate messages. Several lightweight homomorphic message authentication code (HMAC) schemes have been proposed for protecting the transmitted data against pollution attacks;however, most of them are not appropriate for wireless networks or cannot resist tag pollution attacks. In this paper, we present a computationally efficient null space-based homomorphic MAC scheme, for network coding-enabled wireless networks. The proposed scheme makes use of two types of tags (i.e., MACs and D-MACs) to provide resistance against data pollution and tag pollution attacks. Furthermore, we demonstrate that due to its lightweight nature, our proposed scheme incurs a minimal complexity compared to other related schemes.

关键词： Network coding security homomorphic message authentication code data pollution attack tag pollution attack

来源：评论

学校读者我要写书评

暂无评论

A Null Space-based MAC Scheme against Pollution Attacks to Random Linear Network Coding

A Null Space-based MAC Scheme against Pollution Attacks to R...

引用

International Conference on Communication Workshop

作者： Alireza Esfahani Georgios Mantas Jonathan Rodriguez Alberto Nascimento Jose Carlos Neves Instituto de Telecomunicações (IT) Aveiro Portugal

关键词： Network coding security homomorphic message authentication code data pollution attack tag pollution attack

来源：评论

学校读者我要写书评

暂无评论

Comment on "A Novel homomorphic MAC Scheme for authentication in Network Coding"

引用

IEEE COMMUNICATIONS LETTERS 2014年第12期18卷 2129-2132页

作者： Li, Chen Lu, Rongxing Li, Hui Chen, Le Li, Xiaoqing Xidian Univ State Key Lab Integrated Serv Network Xian 710071 Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Xidian Univ State Key Lab Integrated Serv Network Xian 710071 Peoples R China

Recently, Cheng and Jiang [IEEE Commun. Lett., vol. 15, no. 11, pp. 1228-1230, 2011] proposed a novel homomorphic message authentication code (MAC) scheme, called TraceMac, for authentication in network coding, which is based on the trace function over a finite field, and claimed to achieve a reliable security of 1/q(l), where q is the cardinality of the message symbol field F-q, and l is an element of Z(+) is a proper security parameter. A formal proof of its security is also given in their work. However, in this letter, we show that there exists an inherent vulnerability in Cheng-Jiang TraceMac scheme, which results in a forgery attack on the scheme. Moreover, we also point out an error in their formal security proof. We hope that with our discussion, a better understanding of using trace function to design homomorphic MAC scheme can be identified, and similar mistakes can be avoided in future design and security proof of homomorphic MAC scheme for network coding.

关键词： homomorphic message authentication code trace function network coding pollution attack

来源：评论

学校读者我要写书评

暂无评论

TESLA-Based homomorphic MAC for authentication in P2P System for Live Streaming with Network Coding

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2013年第9期31卷 291-298页

作者： Cheng, Chi Jiang, Tao Zhang, Qian Huazhong Univ Sci & Technol Dept Elect & Informat Engn Wuhan Natl Lab Optoelect Wuhan 430074 Peoples R China Hubei Univ Technol Sch Sci Wuhan 430068 Peoples R China Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China

Recently, the peer-to-peer (P2P) live streaming system has benefited from the advent of network coding. However, it was demonstrated that malicious nodes could significantly reduce the network throughput by launching pollution attacks or entropy attacks. In this paper, we propose an efficient symmetric-key based authentication scheme for P2P live streaming system with network coding, to provide in-network detection against pollution attacks and entropy attacks simultaneously. Since the nature of P2P live streaming requires that the detection scheme has high computation efficiency and small communication overheads, we firstly propose a homomorphic message authentication code (MAC), called as PMAC, which has small key size and low computation overhead. Then, the proposed PMAC and the delayed key disclosure technique are employed to make sure that the peers could not only detect the corrupted blocks, but also upload blocks in accordance with random linear network coding. Furthermore, the performance evaluation demonstrates that the proposed scheme has both low communication and computation overheads.

关键词： P2P living streaming random linear network coding pollution attack homomorphic message authentication code

来源：评论

学校读者我要写书评

暂无评论

An Efficient homomorphic MAC with Small Key Size for authentication in Network Coding

引用

IEEE TRANSACTIONS ON COMPUTERS 2013年第10期62卷 2096-2100页

作者： Cheng, Chi Jiang, Tao Huazhong Univ Sci & Technol Dept Elect & Informat Engn Wuhan Natl Lab Optoelect Wuhan 430074 Peoples R China Hubei Univ Technol Sch Sci Wuhan 430068 Peoples R China

Recently, homomorphic message authentication code (MAC) schemes have been proposed to resist against pollution attacks in network coding. However, existing methods face a common challenge: the generated MAC t belongs to a small finite field IFq, which means that an adversary could attack by randomly guessing the value of t, and succeed with probability 1/q. Since q is a predetermined system parameter which is typically set as 28, the resulted security 1/256 could be unsatisfactory in practice. In this paper, we propose an efficient homomorphic MAC for authentication in network coding. The proposed method achieves a reliable security parameter 1/q(l) using only one key, where l could be chosen according to different security requirements. Compared with previous approaches that using multiple tags, the proposed homomorphic MAC has both low computation and communication overheads.

关键词： Network coding pollution attack homomorphic message authentication code

来源：评论

学校读者我要写书评

暂无评论

homomorphic MAC-Based Scheme against Pollution Attacks in Network Coding

引用

Wuhan University Journal of Natural Sciences 2013年第5期18卷 435-442页

作者： ZHANG Yujie CAI Ying LI Zhuo FAN Yanfang School of Computer Beijing Information Science and Technology University Beijing Key Laboratory of Internet Culture and Digital Dissemination Research

Network coding can improve network throughput in large, but it is vulnerable to the data pollution attacks. In this paper, we propose an efficient homomorphic message authentication code （MAC） scheme with discrete logarithm to detect and locate the malicious nodes. We also prove the security property of the scheme theoretically. Its effectiveness is demonstrated, and overhead is analyzed through extensive experiments.

关键词： network coding pollution attacks homomorphic message authentication code discrete logarithm

来源：评论

学校读者我要写书评

暂无评论

homomorphic MAC-Based Scheme against Pollution Attacks in Network Coding

Homomorphic MAC-Based Scheme against Pollution Attacks in Ne...

引用

第七届中国可信计算与信息安全学术会议

作者： ZHANG Yujie CAI Ying LI Zhuo FAN Yanfang School of Computer Beijing Information Science and Technology UniversityBeijing 100101China School of Computer Beijing Information Science and Technology UniversityBeijing 100101China Beijin

Network coding can improve network throughput in large, but it is vulnerable to the data pollution *** this paper,we propose an efficient homomorphic message authentication code (MAC) scheme with discrete logarithm to detect and locate the malicious *** also prove the security property of the scheme *** effectiveness is demonstrated, and overhead is analyzed through extensive experiments.

关键词： network coding pollution attacks homomorphic message authentication code discrete logarithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：