Hidden sources from an arbitrary receiver

Network coding is a novel technique in which internal nodes are permitted to combine independent sources information. In networks that linear network coding is engaged, two main approaches are discussed for the network code design problem of selecting linear combinations: randomized setting and deterministic manner. In this paper we consider a security issue where a set of independent messages are expected to be hidden from an arbitrary receiver. The proposed algorithm prevents the insecure receiver to access the concerned information, based on randomized framework. By this approach we benefit from random network coding advantages by employing time-variant local vectors at some internal nodes. The cost is probable loss of complete randomness in these few nodes.