In the authentication codes with arbiter introduced by Simmons.five cheating attacks were mainly explored.The informationtheoretic lower bounds for the probability of successful deception for the five cheating attacks were obtained by Johnsson.In this paper

the information theoretic lower bounds for the probability of successful deception for spoofing attacks of order i by opponent and receiver are obtained.So the lower bounds for the probability of successful deception are perfected.