Presentation	2010-03-05 Secure Linear Network Coding using Surplus Resources Tomoki KUBO, Kunihiko HARADA, Hirosuke YAMAMOTO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In a network with multicast capacity h, information (S_1,S_2,...,S_) can be sent from a source node to sink nodes securely by using random numbers (R_1,R_2,..., R_t),(0 < t < h), even if an opponent wiretaps t edges in the network. In this case, the rate of secure information is decreased from h to h-t, and it is proved that the rate h-t is optimal. But, in such proofs, it is assumed tacitly that only the source can generate random numbers. In this paper, we show that the rate of secure information can be increased more than h-t if we utilize surplus resources (nodes and edges) that are not used in ordinary multicast network coding. Furthermore, we show how to construct such a network code.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	secure network coding / strongly secure / linear network coding
Paper #	IT2009-142,ISEC2009-150,WBS2009-121
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2010/2/25(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Information Security (ISEC)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Secure Linear Network Coding using Surplus Resources
Sub Title (in English)
Keyword(1)	secure network coding
Keyword(2)	strongly secure
Keyword(3)	linear network coding
1st Author's Name	Tomoki KUBO
1st Author's Affiliation	The University of Tokyo()
2nd Author's Name	Kunihiko HARADA
2nd Author's Affiliation	The University of Tokyo
3rd Author's Name	Hirosuke YAMAMOTO
3rd Author's Affiliation	The University of Tokyo
Date	2010-03-05
Paper #	IT2009-142,ISEC2009-150,WBS2009-121
Volume (vol)	vol.109
Number (no)	445
Page	pp.pp.-
#Pages	6
Date of Issue