We study broadcasting in star graphs containing faulty nodes and/or edges of the Byzantine type. We propose a single-port broadcasting scheme that tolerates up to ⌊n−3d−1/2⌋ Byzantine failures in the n-star graph, where d is the smallest positive integer satisfying n≤d!. The broadcasting time of the scheme is logarithmic in the number of nodes of the n-star graph.