Abstract: According to the drawbacks of the existing secure online code dissemination, a secure online code dissemination algorithm, called XSeluge, was proposed. XSeluge bases on XOR network code and employs the secure framework of Seluge. In XSeluge, the base station firstly divides the program image into a series of pages which are further divided into the packets with fixed-size and computes the hash value of each packet and places it in the proper position. Next, the base station begins the code dissemination with a digital signature. To maximize the number of packets which can be encoded successfully in a time slot, the node chooses the optimal code scheme by the neighbor node table introduced in this paper. Upon receiving the data packet, the node decodes and authenticates it by computing and comparing its hash value. To defense against the attacker where vicious nodes request continuously a data packet from some nodes and send continuously some forged data packet to some nodes, XSeluge expands the structure of original neighbor node table. Based on the new neighbor node table, a receiving counter and sending counter are introduced. The experiment results show XSeluge has similar secure performance with Seluge. Furthermore, XSeluge can reduce total the transmitted data packet during the code dissemination.