Self-adaptive Topology-hiding Broadcast based on CRT

In the course of network communication, the exposure of network topology may seriously result in leaking sensitive information to attackers, saying social relationships or financial flows. Howbeit, balancing the functionality of routing between topology concealment is never a trivial task in consideration of efficiency, robustness, and scalability. Though a certain of topological-hiding protocols have emerged in recent years, they are faulty with third-party dependence and high latency. This paper focuses on devising a broadcast protocol exploiting the structure of ideal. We also implemented it utilizing the Chinese Remainder Theorem (CRT) and compared it with previous schemes. It is proved that our protocol is unconditionally secure under the game-based definition of topology hiding and capable of broadcasting the information with few iterations. Besides, the simulation also demonstrates its preferable computation/communication overhead in contrast with existing protocols, not to mention that any third-party would be unnecessary.