Performance of Secure Network Coding based on Homomorphic Encryption

被引：0

作者：

Choi, Seong-Min ^{[1
]}

Park, Joon-Sang ^{[1
]}

机构：

[1] Hongik Univ, Dept Comp Engn, Seoul, South Korea

来源：

2016 EIGHTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS (ICUFN) | 2016年

关键词：

Random Network Coding; Homomorphic Cryptography; Confidentiality;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Recently, a number of cryptographic security measures for random network coding (RNC) has been proposed in literature in response to the security treats to RNC; however most of them are computationally heavy. In this paper, we evaluate the performance of a secure network coding scheme based on a homomorphic encryption scheme and discuss how to minimize its computational cost. Via experimental results, we argue that our method reduces computational overhead significantly in some settings.

引用

页码：670 / 672

页数：3

共 9 条

[1] Network information flow [J].

Ahlswede, R ;

Cai, N ;

Li, SYR ;

Yeung, RW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216

[2]

Bhattad K., 2005, P NETCOD RIVA GARDA

[3]

Boneh D, 2009, LECT NOTES COMPUT SC, V5443, P68

[4] An Efficient Privacy-Preserving Scheme against Traffic Analysis Attacks in Network Coding [J].

Fan, Yanfei ;

Jiang, Yixin ;

Zhu, Haojin ;

Shen, Xuemin .

IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, :2213-2221

[5]

Gkantsidis C, 2005, IEEE INFOCOM SER, P2235

[6]

Paillier P, 1999, LECT NOTES COMPUT SC, V1592, P223

[7]

Vercauteren Fr'e., 2013, Final report on main computational assumptions in cryptography

[8] Lightweight security for network coding [J].

Vilela, Joao P. ;

Lima, Luisa ;

Barros, Joao .

2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, :1750-1754

[9]

Zhang P., 2010, INFOCOM, 2010 Proceedings IEEE, P1

← 1 →