Presentation	2006-07-28 Strong Ramp Secret Sharing Schemes for Linear Network Coding Kunihiko HARADA, Hirosuke YAMAMOTO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In linear network coding, each edge on the network transfers a linear combination of a message X^h=(X_1,X_2,...,X_h) where X_i is an element of a finite field IF_q. In this paper, we show how a given linear network code of X^h can be linearly transformed to a strongly secure linear network code, which satisfies the following properties for X^h=(S^r,R^), where S^r is a secret message and R^ is a random number. (i) S^r is perfectly secure even if Eve wiretaps any l(1≤l≤h-r) edges, (ii) Any h-l symbols of S^r is perfectly secure even if Eve wiretaps any l(h-r
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Network coding / Secure network coding / Linear network coding / Secret sharing schemes / Strong ramp secret sharing schemes
Paper #	IT2006-40
Date of Issue

Conference Information
Committee	IT
Conference Date	2006/7/21(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 Theory (IT)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Strong Ramp Secret Sharing Schemes for Linear Network Coding
Sub Title (in English)
Keyword(1)	Network coding
Keyword(2)	Secure network coding
Keyword(3)	Linear network coding
Keyword(4)	Secret sharing schemes
Keyword(5)	Strong ramp secret sharing schemes
1st Author's Name	Kunihiko HARADA
1st Author's Affiliation	Graduate School of Information Science and Technology, The University of Tokyo()
2nd Author's Name	Hirosuke YAMAMOTO
2nd Author's Affiliation	Graduate School of Frontier Sciences, The University of Tokyo
Date	2006-07-28
Paper #	IT2006-40
Volume (vol)	vol.106
Number (no)	185
Page	pp.pp.-
#Pages	6
Date of Issue