Chinese Remainder Theorem based DTN group key management

Abstract

Delay Tolerant Network (DTN) has the character of long intermittent connectivity and communication delays, which makes the existing group key management mechanism can not be effectively applied. We proposed a new Chinese Remainder Theorem based group key management mechanism for DTN. Comparing with the early scheme, the existing joined node can derive a new group key from the old group key using hash function in the new user join phase, so the server does not need to broadcast any key update message for the newly user join and only broadcasts one message for user leave. Meanwhile, aiming at the forward security problem in the many-to-many scenarios, the time-based group key management scheme is introduced. The simulation results show that the group key update success rate, latency and message authentication success rate for our scheme is better than CRGK and LKH schemes. Keywords-delay tolerant network; group key management; Chinese remainder theorem; time-based group key I. INTRODUCTIONDelay tolerant network (DTN) is a new network structure, mainly to solve the communication problems between nodes in a communications environment which does not have end-toend reliable connection. DTN is widely exists in the interplanetary Internet, sensor networks and ad hoc networks, and other challenged networks. DTN has the character of long intermittent connectivity and communication delays. The DTN node is not only to provide data forwarding, but also provide temporary storage for data, in order to improve the success rate of the network communication. With the wide range of applications in DTN, its security issues become more and more important, and therefore further research is needed.Group communication is an efficient one-to-many information delivery methods, the literature [1] [2] discuss the implementation of group communication in DTN. The group key management is a basic security measures for group communication that has been widely researched in the wired and wireless networks. However, the current schemes assume there is a stable communication link between the nodes, with little regard to intermittent network connectivity and long delay, and so is not suitable for DTN.

CAKE: An Efficient Group Key Management for Dynamic Groups

“…An example for the broadcast secret is the Secure Lock (SL) [6,2] that enables the creation of a group or a re-keying action using a single broadcast message. The SL scheme is based on the Chinese Remainder Theorem (CRT) [25,24], which uses the properties of congruence to encrypt. However, the reduction of communication overhead is obtained by more complex calculations compared to GKMP so that this approach only renders feasible in special scenarios.…”

“…The GC constructs a CRT congruency in analogy to the SL scheme, so-called Lock MX. Therefore, it uses the individual m i and Key i from all participants of the specified group to calculate the Lock MX to encrypt the GKEK (see CRT calculation [25,24]).…”

Automated key exchange protocol evaluation in delay tolerant networks

“…Group key management in DTN has been studied in [11]. The proposed protocol is based on the Chinese Remainder Theorem.…”

Cryptographic key management in delay tolerant networks

“…The authors suggest a centralized group key management mechanism of the Logical Key Hierarchy (LKH). Group key management in DTN has been studied in [71]. The proposed protocol is based on the Chinese Remainder Theorem.…”