Tree-based group key agreement framework for mobile ad-hoc networks

Abstract. Cognitive radio networks solve the spectrum scarcity problem by dynamically utilizing the unused spectrums. To ensure secure and reliable communication, cognitive radio mobile ad hoc networks require more stringent and secure protocols due to their intrinsic nature. Tree based topology for cognitive radio network is widely used as it takes less time for join and leave operations for the users within the channel of the spectrum compared to other topologies. This paper presents a survey of tree based group key agreement schemes applicable to cognitive radio networks.

show abstract

“…The TFAN [15] combines the two protocols such as µTGDH [16] and µSTR [16]. It is efficient in both computation and communication cost.…”

Section: Ecdh Based Protocolsmentioning

confidence: 99%

Tree Based Group Key Agreement – A Survey for Cognitive Radio Mobile Ad Hoc Networks

Renugadevi

Mala

2014

Advanced Computing, Networking and Informatics- Volume 2

View full text Add to dashboard Cite

show abstract

“…However, due to the lack of a unified group key, messages require multiple encryption and decryption operation which can be a system bottleneck. Distributed schemes have not dedicated group servers, the group key is generated and managed by group members collaboration, such as [7][8] [9]. The disadvantage of the schemes is several rounds of consultations are needed between the nodes.…”

Section: Related Workmentioning

confidence: 99%

Chinese Remainder Theorem based DTN group key management

Chen

2012

2012 IEEE 14th International Conference on Communication Technology

View full text Add to dashboard Cite

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.

show abstract

“…○ Forward secrecy provides security for subtractive events (leave), since it prevents former group members from computing the updated group key. Similarly, backward secrecy provides security for additive events (join), because it prevents new members from discovering the previously used group keys [27].…”

Section: Group Search Secrecymentioning

confidence: 99%

PKIS: practical keyword index search on cloud datacenter

Park

Lee

2011

J Wireless Com Network

View full text Add to dashboard Cite

This paper highlights the importance of the interoperability of the encrypted DB in terms of the characteristics of DB and efficient schemes. Although most prior researches have developed efficient algorithms under the provable security, they do not focus on the interoperability of the encrypted DB. In order to address this lack of practical aspects, we conduct two practical approaches-efficiency and group search in cloud datacenter. The process of this paper is as follows: first, we create two schemes of efficiency and group search-practical keyword index search-I and II; second, we define and analyze group search secrecy and keyword index search privacy in our schemes; third, we experiment on efficient performances over our proposed encrypted DB. As the result, we summarize two major results: (1)our proposed schemes can support a secure group search without re-encrypting all documents under the group-key update and (2)our experiments represent that our scheme is approximately 935 times faster than Golle's scheme and about 16 times faster than Song's scheme for 10,000 documents. Based on our experiments and results, this paper has the following contributions: (1) in the current cloud computing environments, our schemes provide practical, realistic, and secure solutions over the encrypted DB and (2) this paper identifies the importance of interoperability with database management system for designing efficient schemes.

show abstract

Tree-based group key agreement framework for mobile ad-hoc networks

Cited by 26 publications

References 10 publications

Tree Based Group Key Agreement – A Survey for Cognitive Radio Mobile Ad Hoc Networks

Tree Based Group Key Agreement – A Survey for Cognitive Radio Mobile Ad Hoc Networks

Chinese Remainder Theorem based DTN group key management

PKIS: practical keyword index search on cloud datacenter

Contact Info

Product

Resources

About