Source specific centralized secure multicast scheme based on IPSec

Internet Key Exchange version 2 (IKEv2) is taking the responsibility for distribution and management of reliable authentication key. IKEv2 can secure fast hand off, confidentiality of data, safe transmission, and multihoming to transmission node. In this paper, we designed and constructed the network based on real mobile node and experimented the modeling of IKEv2 protocol through the simulation. We analyzed the resetting of authentication key and re-exchange problem. And we experimented the effect that key exchange is affected by a limited bandwidth based on data analysis. To overcome delay time, we proposed multi-interface of node and analyzed performance and latency for authentication setting and exchange process. The simulation results show that re-authentication of key is impossible to reset because of limited bandwidth of network. Also, the use of proposed multi-interface can minimize key exchange latency that happened by hand off for IPSec transmission.

This document describes new Elliptic Curve Cryptography (ECC) groups for use in the Internet Key Exchange (IKE) and Internet Key Exchange version 2 (IKEv2) protocols in addition to previously defined groups. Specifically, the new curve groups are based on modular arithmetic rather than binary arithmetic. These new groups are defined to align IKE and IKEv2 with other ECC implementations and standards, particularly NIST standards. In addition, the curves defined here can provide more efficient implementation than previously defined ECC groups. This memo provides information for the Internet community.

This document describes new Elliptic Curve Cryptography (ECC) groups for use in the Internet Key Exchange (IKE) and Internet Key Exchange version 2 (IKEv2) protocols in addition to previously defined groups. Specifically, the new curve groups are based on modular arithmetic rather than binary arithmetic. These new groups are defined to align IKE and IKEv2 with other ECC implementations and standards, particularly NIST standards. In addition, the curves defined here can provide more efficient implementation than previously defined ECC groups. This version incorporates the erratum for RFC 4753, which changes the format of the Diffie-Hellman shared secret value.

Problem statement: Multicasting communication network accepted a single message from an application and delivered copies of the message to multiple recipients at different locations. Recently, there has been an explosion of research literature on multicast communication environment. The objective of this study were to contribute the complexity of supporting current multicast applications, (i) the lack of reliable multicast transport mechanisms at the network level and (ii) the lack of network support for large scale multicast communication. The scaling problem of secure multicast key distribution compounded for the case where sender-specific keys need to be distributed to a group and required for sender-specific authentication of data traffic and minimize control overhead (iii) compare RC4, AES-128,RS(2) and RS(3) computation time of both algorithms. Approach: Algorithms were collected and performed computation time. In general the multicast key distribution scheme implemented for distributing 128 bit session keys. Thus the Maximum Distance Separable Codes (MDS Codes) needed for their encoding and decoding process. In rekeying scheme errors were occurred during over period of time or at a particular point of time and to eliminate all these errors in the level of encryption and decryption mechanism. The MDS codes played an important role in providing security services for multicast, such as traffic, integrity, authentication and confidentiality, is particularly problematic since it requires securely distributing a group (session) key to each of a group’s receivers. Results: First we showed that internet multicasting algorithms based on reverse path forwarding were inherently unreliable and present a source-tree-based reliable multicasting scheme also. The new scheme proposed and used as an inter-gateway protocol and worked on top of the previously developed distance vector and link state internet routing schemes. Next, to support large scale applications, we presented a scheme for partial multicasting and introduced a new network level operation, called gather. The partial multicasting mechanism allowed messages to be delivered to subsets of multicast destinations, while the gather operation aids gateways in selectively suppressing redundant messages, thus reducing the message complexity. Conclusion: Hence the findings suggested the control overhead reasonably minimized and using simulations, we investigated the efficiency of our schemes in supporting scalable application domain based multicast communication.

The efficient and high throughput multicast communication in interconnection networks is known as a fundamental but hard problem. In the literature, most of the related works handle multicast communication within limited operating conditions and low throughput. Recently, a new multicast scheme, known as qualified groups QG, was proposed in [2] and has shown promising performance characteristics. However, this scheme has been examined only, so far, under deterministic routing and symmetric networks. In order to examine the QG in more realistic and different scenarios, this paper makes two major contributions. Firstly, the QG is generalised here to handling multicast communication in symmetric, asymmetric and different network sizes. Secondly, unlike most existing multicast algorithms the present study proposes a new adaptive multicast algorithm that maintains good performance levels for various system sizes. Our experiments show that the QG exhibits significant improvement in both throughput and multicast latency.

As quantum computing advances, migrating Internet Key Exchange version 2 (IKEv2) to the scenario of post-quantum cryptography (PQC) is critical for protecting IPsec VPNs. The current solution standardized by the Internet Engineering Task Force (IETF) introduces IKE_INTERMEDIATE exchanges with fragmentation. However, its inherent reliance on a full-message retransmission model causes a severe performance issue in lossy networks. While previous research has quantified this exponential overhead, it has not resolved the underlying conflict between fragmented transmission and full-message retransmission. To address this inefficiency, this paper proposes a lightweight, cache-based selective retransmission mechanism using bitmap acknowledgments. We construct a theoretical model to reveal the root cause of the standard scheme’s overhead and design our backward-compatible solution. A prototype is then implemented and validated on the strongSwan platform. Results demonstrate that our mechanism reduces additional transmission overhead by over 60% under lossy conditions. This work provides a critical optimization for deploying post-quantum protocols in realworld environments, enabling the practical application of large-payload PQC algorithms.

A network-assisted mobile VPN for securing users data in UMTS

An attempt is made to realize highly reliable multicast communications without modifying the TCP protocol, which is now the most widely used in the Internet, and TCP multicast using a GRA (generic router assist) router is proposed. The characteristics of this multicast communications are evaluated, and it is shown that the overall throughput of multicast communications is governed by the bottleneck link in the transmission band. An attempt is made to improve the performance of multicast communications with a bottleneck link, and an environment‐adaptive multicast communication scheme is proposed, in which the multicast tree is partitioned at the bottleneck link, and TCP multicasting is performed for each subtree. Performance evaluation by simulation shows that the proposed method alleviates the effect of the bottleneck link on the overall multicast and that the performance of the multicast as a whole can be improved. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 87(3): 28–38, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.10161

A powerpoint presentation is given. The paper discusses the experimental evaluation of the performance costs of different IKEv2 authentication methods. Internet key exchange version 2 protocol negotiates security associations for IPsec, authenticates the peer, supports the extensible authentication protocol methods and a candidate technology in future AAA frameworks which is a major issue in next generation wireless networks.

Problem statement: Mobile Ad-hoc Network is infrastructureless network supported by no fixed trusted infrastructure. The packets had a chance to drop or hacked by eavesdropper during transmission. So, encryption method is required for sending and receiving packet in secret manner. Approach: In this approach, the block and key size had been increased by 256 bits. When compared to Rijndael algorithm, it was more secure and effective. To attain security goals like: authentication, integrity, non- repudation, privacy, a secret key was necessary to be shared between the sender and receiver. For data communication, we use MAC address for exchanging packet with encrypted key exchange system. Results: For encryption, In Rijndael algorithm the whole data had to be run twice but our proposed algorithm would encrypt the whole data and run once. The encryption was done with neighborhood key and with message specific key for the enhancement of security. Conclusion: In our algorithm, the time required to break an encryption scheme is excessive as the key size is larger. Here the security is focusing the application level. The forward and backward security is ensured with neighborhood and with message specific key for the route discovery.

Without doubt, multicast communication as a means for one-to-many or many-to-many delivery of data has become a hot topic in multimedia environments. A lot of people are interested in multicast: the research community, standards groups and Internet Service Providers (ISP) among them. Although IP multicast is a very good solution for Internetworking multimedia in many-to-many communications, there are still issues that have not been completely solved. Protocols are still evolving and new protocols are constantly coming up to solve these issues because that is the only way for making multicast become a true Internet service. The main goal of this chapter is to describe the evolution of IP multicast from the obsolete MBone (Multicast Backbone) and intra-domain multicast routing to the actual inter-domain multicast routing scheme. We will pay special attention to the challenges and problems that need to be solved, the problems that have been solved and the way they were solved. We will make a complete picture of the state of the art explaining the idea behind each protocol and how all those protocols work together.

Wireless sensor networks are usually deployed in harsh environment or a hostile environment, vulnerable to various attacks. A key agreement scheme is proposed in order to solving the problem that traditional key system can not withstand attacks from internal node captured. The way of judgment node credibility is to calculate the trust value by establishing node communication behavior reputation model. Trusted neighbors exchange public key certificate by the base station to generate and signed. A new authenticated key agreement is designed based on each other's Identity information and public key certificates, combined with the elliptic curve cryptosystem. The program can resist the malicious behavior of the internal and external nodes effectively, make network security and survivability enhance significantly compared with other programs, make the network have good scalability, and ensure the key forward security and backward security.

Internet of Things-based environments pose various challenges due to their anytime/anywhere computing, and the efficient cryptographic based key management is one of the major challenges in Internet of Things. The key management life cycle consists of initialization, key generation, key registration, key backup, key update, key recovery, and key revocation. Our contribution in this paper is to summarize the state-of-the-art key management schemes and techniques in different scenarios, such as mobile ad hoc networks, wireless sensor networks, and the Internet of Things environments. Further different issues related specifically to the Internet of Things environment are discussed and the causes and effects pertaining to the security breach for Internet of Things are identified. Furthermore, in this research work, we develop a novel permutation of threshold and identity-based key management schemes for the Internet of Things environment and have proposed future directions to counteract the attacks on confidentiality, integrity, authentication, and availability of security services in the Internet of Things environment and identified the two key management schemes, that is, identity and threshold schemes for Internet of Things, to resolve Internet of Things key management issues and maximum possible security services effective implementation. We evaluate our scheme with the help of mathematical and statistical techniques.

Multicast communication has been researched for many years in efforts to simultaneously achieve high throughput and good fairness, which have a trade-off relationship. Recently, a cooperative multicast scheduling scheme was proposed. It is considered a promising solution owing to its trade-off characteristics realized by promoting user cooperation among group members. However, it requires significant relay power consumption for user cooperation, since all group members in a good channel condition should relay without checking whether there is at least one user requesting a relay in the transmission boundary. Therefore, in order to resolve this inefficiency, we proposed an energy efficient cooperative multicast scheme (EECM) based on selective relay. We can achieve reduced unnecessary relay power expenditure by selecting relay users with consideration of the condition of nearby users. The performance results derived from a numerical analysis reveal that the proposed scheme requires less energy consumption than the existing solution with almost the same throughput performance.

This paper presents a novel group key management protocol based on secure key calculation code, which achieves the security requirements of forward security, backward security and collusion resistance. Compared with LKH (logical key hierarchy) and OFT (one-way function tree) protocol, the performance of our protocol is more efficient in crucial rekeying process when group members change dynamically. In fact, the required communication of rekeying is almost the same as that in the most efficient protocol CKC (code for key calculation), but we repair the security vulnerability found in CKC. In addition, we propose an encryption manner named “one message one key” by use of key evolution. It enables that every group member employs a distinct key when encrypting a new message, which improves the security level furthermore.