In this paper, the problem of distributed detection in tree networks in the presence of Byzantines is considered. Closed form expressions for optimal attacking strategies that minimize the miss detection error exponent at the Fusion Center (FC) are obtained. The authors also look at the problem from the network designer's (FC's) perspective. They study the problem of designing optimal distributed detection parameters in a tree network in the presence of Byzantines. Next, they model the strategic interaction between the FC and the attacker as a leader-follower (Stackelberg) game.