Authentication and Secrecy of Multicast Communication Scenario: Artificial Noise-Aided Costas Sequence Matrix FDA ApproachRead the full article
Security and Communication Networks provides a prestigious forum for the R&D community in academia and industry working at the interdisciplinary nexus of next generation communications technologies for security implementations in all network layers.
Security and Communication Networks maintains an Editorial Board of practicing researchers from around the world, to ensure manuscripts are handled by editors who are experts in the field of study.
Latest ArticlesMore articles
Modelling Features-Based Birthmarks for Security of End-to-End Communication System
Feature-based software birthmark is an essential property of software that can be used for the detection of software theft and many other purposes like to assess the security in end-to-end communication systems. Research on feature-based software birthmark shows that using the feature-based software birthmark joint with the practice of software birthmark estimation together can deliver a right and influential method for detecting software piracy and the amount of piracy done by a software. This can also guide developers in improving security of end-to-end communication system. Modern day software industry and systems are in demand to have an unbiased method for comparing the features-based birthmark of software competently, and more concretely for the detecting software piracy and assessing the security of end-to-end communication systems. In this paper, we proposed a mathematical model, which is based on a differential system, to present feature-based software birthmark. The model presented in this paper provides an exclusive way for the features-based birthmark of software and then can be used for comparing birthmark and assessing security of end-to-end communication systems. The results of this method show that the proposed model is efficient in terms of effectiveness and correctness for the features-based software birthmark comparison and security assessment purposes.
Certificate-Based Encryption Resilient to Continual Leakage in the Standard Model
The security for many certificate-based encryption schemes was considered under the ideal condition, where the attackers rarely have the secret state for the solutions. However, with a side-channel attack, attackers can obtain partial secret values of the schemes. In order to make the scheme more practical, the security model for the certificate-based encryption which is resilient to continual leakage is first formalized. The attackers in the security model are permitted to get some secret information continuously through the side-channel attack. Based on the certificate-based key encapsulation scheme, a novel certificate-based encryption scheme is proposed, which is resilient to the continual leakage. In the standard model, the new scheme we propose is proved to be secure under the decisional truncated q-augmented bilinear Diffie–Hellman exponent hard problem and the decisional 1-bilinear Diffie–Hellman inversion hard problem. Additionally, the new scheme can resist the chosen-ciphertext attack. Moreover, a comparison is performed with other related schemes, where the proposed solution further considers the continual leakage-resilient property and exhibits less computation cost.
VoNR-IPD: A Novel Timing-Based Network Steganography for Industrial Internet
As the predominant trade secret of manufacturing enterprises, industrial data may be monitored and stolen by competitive adversaries during the transmission via open wireless link. Such information leakage will cause severe economic losses. Hence, a VoNR-IPD covert timing steganography based on 5G network is proposed in this paper, in which VoNR traffic is employed as the steganographic carrier of covert communication in Industrial Internet. Interference of network jitter noise is fully considered and the high-order statistical properties of jittered VoNR interpacket delays (IPDs) are imitated during the modulation of confidential industrial data. Thus, the generated covert VoNR IPDs can possess consistent statistical properties with the normal case in order to improve undetectability. Besides, the synchronization mechanism of steganographic embedding mode is designed to control the embedding density of industrial data flexibly. The experimental results show that our scheme can resist statistical-based detections and the network noise effectively, which outperforms the existing methods in terms of undetectability and robustness.
A Lattice-Based Authentication Scheme for Roaming Service in Ubiquitous Networks with Anonymity
In the ubiquitous networks, mobile nodes can obtain roaming service that enables them to get access to the services extended by their home networks in the field of foreign network. To provide secure and anonymous communication for legal mobile users in roaming services, there should be a mutual authentication between mobile user and foreign agent with the help of home agent. There are many roaming authentication schemes which have been proposed; however, with the progress of quantum computation, quantum attack poses security threats to many traditional public key cryptography-based authentication schemes; thus, antiquantum attack roaming authentication schemes need to be investigated. On account of the limitation of computational resources for mobile nodes, a lightweight anonymous and antiquantum authentication schemes need to be developed to enable mobile nodes to roam across multiple service domains securely and seamlessly. In consideration of the advantages of lattice in antiquantum, an NTRU-based authentication scheme with provable security and conditional privacy preservation is proposed to remedy these security weaknesses. Compared with the existing scheme, the proposed scheme not only improves efficiency but also can resist the quantum attack.
Secure Multiusers Directional Modulation Scheme Based on Random Frequency Diverse Arrays in Broadcasting Systems
In this paper, we research a synthesis scheme for secure wireless communication in the broadcasting multiusers directional modulation system, which consists of multiple legitimate users (LUs) receiving the same confidential messages and multiple eavesdroppers (Eves) intercepting the confidential messages. We propose a new type of array antennas, termed random frequency diverse arrays (RFDA), to enhance the security of confidential messages due to its angle-range dependent beam patterns. Based on RFDA, we put forward a synthesis scheme to achieve multiobjective secure wireless communication. First, with known locations of Eves, the beamforming vector is designed to minimize Eves’ receiving power of confidential message (Min-ERP) while satisfying the power requirement of LUs. Furthermore, we research a more practical scenario, where locations of Eves are unknown. Unlike the scenario of known locations of Eves, the beamforming vector is designed to maximize the sum received power of LUs (Max-LRP) while satisfying a minimum received power constraint at each LU. Second, the artificial-noise projection matrix (ANPM) is calculated to reduce artificial-noise (AN) impact on LUs and enhance the interference on Eves. Numerical results verify the superior secure performance of the proposed schemes in the broadcasting multiusers system.
Parallel and Regular Algorithm of Elliptic Curve Scalar Multiplication over Binary Fields
Accelerating scalar multiplication has always been a significant topic when people talk about the elliptic curve cryptosystem. Many approaches have been come up with to achieve this aim. An interesting perspective is that computers nowadays usually have multicore processors which could be used to do cryptographic computations in parallel style. Inspired by this idea, we present a new parallel and efficient algorithm to speed up scalar multiplication. First, we introduce a new regular halve-and-add method which is very efficient by utilizing projective coordinate. Then, we compare many different algorithms calculating double-and-add and halve-and-add. Finally, we combine the best double-and-add and halve-and-add methods to get a new faster parallel algorithm which costs around less than the previous best. Furthermore, our algorithm is regular without any dummy operations, so it naturally provides protection against simple side-channel attacks.