Conditions for Achieving a Revocable Network Coding Scheme

摘要

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.