Reduction Theorem for Secrecy over Linear Network Code for Active Attacksâ€
Round 1
Reviewer 1 Report
Please see attach files for details.
Comments for author File: 
Comments.pdf
Author Response
Thank you for your helpful comment.
We changed the word "improve" to "increase".
However, we would like to keep the name of the theorem; "Reduction Theorem" due to the following reason while you suggest to change it to "Invariant Theorem". When we use the word "Invariant theorem", it is not so clear what is invariant in this context. Our theorem means that the secrecy under an active attack is reduced to the secrecy under a passive attack. That is, the word "Reduction" has the meaning that a complicated situation is reduced to a simple situation. Hence, we would like to use the word "Reduction Theorem".
Reviewer 2 Report
The article is very clear and very educational. It clarifies an attack situation (active attack) and it specifies the conditions of reception and confidentiality of a message in particular circumstances (linear network, causal conditions) on a network. The analysis of a counter example makes it possible to understand the importance of the conditions in which the experiment is carried out. Alice sends Bob a message over a network. Eve, the spy, will try to intercept the message by entering the message in several places and in several time conditions on the network and attempt to falsify the message by polluting the network (by injecting noise). So Bob will be able (or not) to retrieve the content of the message. Alice will also send this message several times over the network. Eve will be completely victorious when she prevents Bob from receiving the message and when she retrieves the content of the message. Alice will win when Eve fails in all her attempts. The article shows that the linearity of the network is essential for the so-called reduction theorem. A practical example explains well all these different experiences of attacks and thus clarifies the hypotheses. Further development of the example would allow one to become more familiar with the article notations, which are difficult to grasp if the reader is not familiar with these crypto scenarios.
It is clear that this article is of interest only to crypto specialists.
minor typo error
Line 407 uniqueness conditions of this bog network => uniqueness conditions of this big network
Author Response
Thank you for your comment. We changed "bog" to "big".
