Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Secure Network Code for Adaptive and Active Attacks with No-Randomness
  in Intermediate Nodes   In secure network coding, there is a possibility that the eavesdropper can
improve her performance when she changes (contaminates) the information on the
attacked edges (active attack) and chooses the attacked edges adaptively
(adaptive attack). We analyze the security for network code over such types of
attacks. We show that active and adaptive attacks cannot improve the
performance of the eavesdropper when the code is linear. Further, we give a
non-linear example, in which an adaptive attack improves the performance of the
eavesdropper. We derive the capacity for the unicast case and the capacity
region for the multicast case or the multiple multicast case in several
examples of relay networks, beyond the minimum cut theorem, when no additional
random number is allowed as scramble variables in the intermediate nodes. No
prior study compared the difference of the capacity and the capacity region
between the existence and the non-existence of randomness in the intermediate
nodes under these network models even with non-adaptive and non-active attacks.

15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ
32
The categories of this paper are: atom-ph
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
36
The categories of this paper are: cmp-lg
11
The categories of this paper are: hep-lat
19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio
23
The categories of this paper are: solv-int
14
The categories of this paper are: math-ph
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph