Presentation | 2008-02-28 Conditions for Achieving a Revocable Network Coding Scheme Hidenori KUWAKADO, Masakatu MORII, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | In this paper, we introduce the concept of revocation into network coding. The revocation means that a source can dynamically select sinks that cannot obtain information. Even if revoked sinks are changed, encoding methods of all nodes are unchanged. It follows that intermediate nodes have not to know what sinks are revoked. This paper discusses conditions for existing revocable network code. Since the revocable network code shown in this paper is based on the secret sharing scheme based on the monoid, networks to which idea is applicable are restricted. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | network coding / revocation / monoid |
Paper # | IT2007-40,ISEC2007-137,WBS2007-71 |
Date of Issue |
Conference Information | |
Committee | ISEC |
---|---|
Conference Date | 2008/2/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 Security (ISEC) |
---|---|
Language | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Conditions for Achieving a Revocable Network Coding Scheme |
Sub Title (in English) | |
Keyword(1) | network coding |
Keyword(2) | revocation |
Keyword(3) | monoid |
1st Author's Name | Hidenori KUWAKADO |
1st Author's Affiliation | Graduate School of Engineering, Kobe University() |
2nd Author's Name | Masakatu MORII |
2nd Author's Affiliation | Graduate School of Engineering, Kobe University |
Date | 2008-02-28 |
Paper # | IT2007-40,ISEC2007-137,WBS2007-71 |
Volume (vol) | vol.107 |
Number (no) | 500 |
Page | pp.pp.- |
#Pages | 4 |
Date of Issue |