Secure devices using entropy multiplexing

1. A computing apparatus to implement secure devices using entropy multiplexing, the computing apparatus comprising:

a processor; and

a memory storing instructions that, when executed by the processor, configure the computing apparatus to:

access an entropy-multiplexing (EM) tree containing a plurality of tree depths;

transmit, using a wireless transceiver, a first message to a set of neighbor devices, at least a portion of the first message encrypted using a first seed value generated using a first tree depth of the plurality of tree depths and a first clock value of an originating device;

receive a response from a neighbor device of the set of neighbor devices, the response including a second message, the second message encrypted using a second seed value generated using a second tree depth of the plurality of tree depths and a second clock value;

decrypt the second message using a third seed value generated using the second tree depth and a third clock value of the originating device;

generate, at a predetermined time interval, a third message, the third message encrypted using a fourth seed value generated using the first tree depth and a fourth clock value of the originating device, wherein the time interval is based on a period of time taken to transmit the first message to a set of devices on the network; and

transmit the third message to the set of neighbor devices.

2. The computing apparatus of claim 1 , further comprising instructions that, when executed by the processor, configure the computing apparatus to:

receive a respective security configuration of each neighbor device neighbor devices;

establish a secure communication channel with respective devices of the set of neighbor devices based on an evaluation of the respective security configuration against a set of acceptable security configurations; and

transmit the first message using the secure communication channel.

3. The computing apparatus of claim 1 , further comprising instructions that, when executed by the processor, configure the computing apparatus to:

transmit the first message to a device on a different network using the neighbor device.

4. The computing apparatus of claim 1 , wherein the at least a portion of first message includes a master clock value.

5. The computing apparatus of claim 4 , further comprising instructions that, when executed by the processor, configure the computing apparatus to:

receive the master clock value; and

synchronize a clock of the originating device using the master clock value.

6. The computing apparatus of claim 3 , further comprising instructions that, when executed by the processor, configure the computing apparatus to:

transmit to a neighbor device of the set of neighbor devices a challenge message using the first seed value;

receive a challenge response from the neighbor device; and

discontinue secure communication with the neighbor device based on the challenge response being outside a designated threshold.

7. At least one non-transitory computer-readable storage medium to implement secure devices using entropy multiplexing, the at least one computer-readable storage medium including instructions that when executed by a computer, cause the computer to:

access an entropy-multiplexing (EM) tree containing a plurality of tree depths;

transmit, using a wireless transceiver, a first message to a set of neighbor devices, at least a portion of the first message encrypted using a first seed value generated using a first tree depth of the plurality of tree depths and a first clock value of an originating device;

receive a response from a neighbor device of the set of neighbor devices, the response including a second message, the second message encrypted using a second seed value generated using a second tree depth of the plurality of tree depths and a second clock value;

decrypt the second message using a third seed value generated using a third seed value generated using the second tree depth and a third clock value of the originating device;

generate, at a predetermined time interval, a third message, the third message encrypted using a fourth seed value generated using the first tree depth and a fourth clock value of the originating device, wherein the time interval is based on a period of time taken to transmit the first message to a set of devices on the network; and

transmit the third message to the set of neighbor devices.

8. The at least one computer-readable storage medium of claim 7 , further comprising instructions that when executed by a computer, cause the computer to:

receive a respective security configuration of each neighbor device of the set of neighbor devices;

establish a secure communication channel with respective devices of the set of neighbor devices based on an evaluation of the respective security configuration against a set of acceptable security configurations; and

transmit the first message using the secure communication channel.

9. The at least one computer-readable storage medium of claim 7 , further comprising instructions that when executed by a computer, cause the computer to:

transmit the first message to a device on a different network using the neighbor device.

10. The at least one computer-readable storage medium of claim 7 , wherein the at least a portion of first message includes a master clock value.

11. The at least one computer-readable storage medium of claim 10 , further comprising instructions that when executed by a computer, cause the computer to:

receive the master clock value; and

synchronize a clock of the originating device using the master clock value.

12. The at least one computer-readable storage medium of claim 7 , further comprising instructions that when executed by a computer, cause the computer to:

transmit to a neighbor device of the set of neighbor devices a challenge message using the first seed value;

receive a challenge response from the neighbor device; and

discontinue secure communication with the neighbor device based on the challenge response being outside a designated threshold.

13. A method to implement secure devices using entropy multiplexing, comprising electronic operations, which when performed by circuitry of computing device, causes the computing device to perform the electronic operations including:

accessing an entropy-multiplexing (EM) tree containing a plurality of tree depths;

transmitting, using a wireless transceiver, a first message to a set of neighbor devices, at least a portion of the first message encrypted using a first seed value generated using a first tree depth of the plurality of tree depths and a first clock value of an originating device;

receiving a response from a neighbor device of the set of neighbor devices, the response including a second message, the second message encrypted using a second seed value generated using a second tree depth of the plurality of tree depths and a second clock value;

decrypting the second message using a third seed value generated using the second tree depth and a third clock value of the originating device;

generating, at a predetermined time interval, a third message, the third message encrypted using a fourth seed value generated using the first tree depth and a fourth clock value of the originating device, wherein the time interval is based on a period of time taken to transmit the first message to a set of devices on the network; and

transmitting the third message to the set of neighbor devices.

14. The method of claim 13 , further comprising:

receiving a respective security configuration of each neighbor device of the set of neighbor devices;

establishing a secure communication channel with respective devices of the set of neighbor devices based on an evaluation of the respective security configuration against a set of acceptable security configurations; and

transmitting the first message using the secure communication channel.

15. The method of claim 13 , further comprising:

transmitting the first message to a device on a different network using the neighbor device.

16. The method claim 13 , wherein the at least a portion of first message includes a master clock value.

17. The method of claim 16 , further comprising:

receiving the master clock value; and

synchronizing a clock of the originating device using the master clock value.

18. The method of claim 13 , further comprising:

transmitting to a neighbor device of the set of neighbor devices a challenge message using the first seed value;

receiving a challenge response from the neighbor device; and

discontinuing secure communication with the neighbor device based on the challenge response being outside a designated threshold.