Search

B5G/6G networks are facing challenges in the deployment of additional base stations. However, Taiwan's four major operators have launched VoWi‐Fi calling services to maintain signal quality and coverage for customers. These services pose potential threats when users connect to untrusted Wi‐Fi networks. Therefore, the authors utilised commercial equipment to study the security of VoWi‐Fi calling services offered by Taiwan's four major telecom companies. The authors employed address resolution protocol attack methods to develop two verification attacks that bypass existing security measures: one for dropping session initiation protocol packets and the other for dropping voice call packets, both capable of circumventing current security defences. Through real‐world experiments, the authors confirmed their feasibility and assessed their potential harm. Consequently, two defence methods are proposed. The first is an anti‐attack algorithm for app and device manufacturers to detect the security of the user's calling environment. The second is a recommendation for telecom operators to implement new detection mechanisms to safeguard user rights. The cover image is based on the Case Study VoWi‐Fi security threats: Address resolution protocol attack and countermeasures by Kuan‐Chu Lu et al., https://doi.org/10.1049/ntw2.12113 [ABSTRACT FROM AUTHOR]

The cover image is based on the Case Study VoWi‐Fi security threats: Address resolution protocol attack and countermeasures by Kuan‐Chu Lu et al., https://doi.org/10.1049/ntw2.12113.By Kuan‐Chu Lu; I.‐Hsien Liu; Keng‐Hao Chang and Jung‐Shian LiReported by Author; Author; Author; Author [Extracted from the article]

The current network-based intrusion detection systems have a very high rate of false alarms, and this phenomena results in significant efforts to gauge the threat level of the anomalous traffic. In this paper, we propose an intrusion detection mechanism based on honeypot log similarity analysis and data mining techniques to predict and block suspicious flows before attacks occur. With honeypot logs and association rule mining, our approach can reduce the false alarm problem of intrusion detection because only suspicious traffic would be present in the honeypots. The proposed mechanism can reduce human effort, and the entire system can operate automatically. The results of our experiments indicate that the honeypot prediction system is practical for protecting assets from attacks or misuse. [ABSTRACT FROM AUTHOR]

SUMMARY One of the key technologies in cloud computing is virtualization. Using virtualization, a system can optimize usage of resources, simplify management of infrastructure and software, and reduce hardware requirements. This research focuses on infrastructure as a service, resource allocation by providers for consumers, and explores the optimization of system utilization based on actual service traces of a real world cloud computing site. Before activating additional virtual machines (VM) for applications, the system examines CPU usage in the resource pools. The behavior of each VM can be estimated by monitoring the CPU usage for different types of services, and consequently, additional resources added or idle resources released. Based on historical observations of the required resources for each kind of service, the system can efficiently dispatch VMs. The proposed scheme can efficiently and effectively distribute resources to VMs for maximizing utilization of the cloud computing center. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

As the volume of multimedia digital information transmitted over the Internet continues to rise, the problem of preventing the unauthorized tampering and dissemination of digital content has emerged as a major concern. Thus, the present study proposes a forensic scheme for tracking the dissemination of copyright-protected JPEG images over the Internet. The proposed scheme incorporates two basic mechanisms, namely signature embedding and signature detecting. To preserve the quality of the protected JPEG images, the signature is embedded at the application layer. By contrast, the signature detection process is performed at the packet level in order to improve the scalability of the proposed mechanism. For any flows regarded as suspicious, the signatures embedded in the JPEG packet trains are compared with the known digital signatures for forensic purposes. The experimental results show that the embedded signature has no effect on the visual quality of the JPEG image. Moreover, it is shown that the computational complexity of the proposed detection scheme is significantly lower than that of existing application-level schemes. Thus, the scheme provides an ideal solution for the forensic analysis of JPEG streams over large-scale network environments such as the Internet. [ABSTRACT FROM AUTHOR]

SUMMARY The continuous evolvement of the e-domain has led to a significant increase in the amount of sensitive personal information stored on networked hosts. These hosts are invariably protected by security mechanisms such as intrusion detection systems, Intrusion Prevention System (IPS), antivirus software, firewalls, and so forth. However, they still remain vulnerable to the threat of malicious attacks, theft and intrusion. The high false positive alarm rate of such mechanisms is particularly troublesome because false alarms greatly degrade the efficiency of the security framework. Security operation centers (SOCs) provide an automated solution for analyzing the threat to a network such that appropriate protective measures can be put in place. This paper proposes a novel hierarchical mobile-agent-based SOC to overcome the vulnerability of traditional static SOCs to single point of failure attacks. In addition, the network is partitioned into multiple divisions, each with its own alert detection and aggregation methodology to improve the computational efficiency of the data collection and fusion process. The data acquired in the various divisions are fused and correlated in an efficient manner via intrusion detection message exchange format, XML, session and timer methods The experimental results confirm the effectiveness and efficiency of the proposed hierarchical mobile-agent-based SOC framework. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY Live media streaming over peer-to-peer (P2P) network structures is commonplace nowadays. However, with the large number of users in a typical P2P system, it is impractical to use the central server to process the key information update requests of all the users Accordingly, the present study proposes a distributed key management scheme in which the server is only required to transmit the key update information to a limited number of users. To further reduce the load on the server, the update information is distributed using a hop-by-hop approach. An effective method is proposed for protecting the key update information as it is propagated through the network. In addition, a technique is presented for ensuring the security of the certificates used in the system It is shown that the distributed key management scheme and authentication procedure ensure an efficient and secure P2P live streaming performance even in the event of high churn rates. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY Minimizing the schedule frame length in spatial time division multiple access networks is essential in enhancing the performance of multiplayer interactive applications in multiple-group multicasting environments. In this paper, the joint link scheduling and multiple-group communication problem in such networks is referred to as a real-time multiple-group communication tree scheduling (RMGCTS) problem in which the objective is to minimize the total schedule frame length. It is shown that the RMGCTS problem can be represented as an integer linear programming problem. Two particular RMGCTS problems are considered, namely, back-to-back RMGCTS for applications with a receiving-jitter constraint, and general RMGCTS for applications with a delay constraint. Two heuristic algorithms, designated as back-to-back scheduling and level-by-level scheduling, are proposed to provide efficient solutions of the back-to-back and general RMGCTS problems by maximizing the spatial reuse capability within each time slot, thereby minimizing the schedule frame length. The simulation results show that the proposed schemes yield an effective reduction in the length of the multicast schedule frame compared to that obtained from existing tree-based or pure-color scheduling algorithms. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY In local loss recovery schemes, a small number of recovery nodes distributed along the transmission paths save incoming packets temporarily in accordance with a specified cache policy and retransmit these packets if they subsequently receive a request message from a downstream receiver. To reduce the recovery latency, the cache policy should ensure that the recovery nodes are always able to satisfy the retransmission requests of the downstream receivers. However, owing to the limited cache size of the recovery nodes and the behavior of the cache policy, this cannot always be achieved, and thus some of the packets must be retransmitted by the sender. Accordingly, this paper develops a new network-coding-based cache policy, designated as network-coding-based FIFO (NCFIFO), which extends the caching time of the packets at the recovery nodes without dropping any of the incoming packets. As a result, the lost packets can be always recovered from the nearest recovery nodes and the recovery latency is significantly reduced. The loss recovery performance of the NCFIFO cache policy is compared with that of existing cache policies by performing a series of simulation experiments using both a uniform error model and a burst error model. The simulation results show that the NCFIFO cache policy not only achieves a better recovery performance than existing cache policies, but also provides a more effective solution for managing a small amount of cache size in environments characterized by a high packet arrival rate. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Radio-frequency identification (RFID) technology enables the identification and tracking of objects by means of the wireless signals emitted by a tag attached to the objects of interest. Without adequate protection, however, malicious attackers can easily eavesdrop, scan or forge the information within the tag, thereby threatening the integrity of the system. Previous research has shown that the basic security requirements of RFID systems, i.e. identity authentication, information privacy and location privacy, can be satisfied using conventional cryptographic components. However, such components are expensive, and therefore conflict with the general requirement for low-cost tag designs. Accordingly, this paper presents a low-cost challenge-response security protocol designated as the hidden mutual authentication protocol (HMAP) to accomplish both a mutual authentication capability between the tag and the reader and information privacy. The results show that HMAP provides an efficient means of concealing the authentication messages exchanged between the tag and the reader and is robust toward replay attacks. In addition, it is shown that HMAP is easily extended to provide complete location privacy by utilizing a hash function to generate different tag identifiers in each authentication session. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

A secure architecture is proposed in the home/office networking environment with a special appliance, called Building Security Gateway (BSG), for cheap SIP devices and unsupported soft user agents (UAs) performing security functions successfully, such as construction of secure sessions and encrypting/decrypting media. Therefore, we apply BSG procedure to VoIP for getting secure session. Furthermore, VoIP call monitoring and intercepting functions are also implemented in BSG. Secure session monitoring is supported in this architecture. A prototype BSG is built in a home/office network, and BSG-based session mobility cases between UAs are examined and the protocol primitives for security and call intercepting are verified. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]