Search

The field of quantum technologies has garnered considerable interest and witnessed noteworthy progress in recent years. It is also anticipated that these technologies will continue to flourish and exert a considerable influence on society, i.e., a plethora of real-world problems that cannot be solved by classical algorithms are believed to benefit from the implementation of quantum algorithms. Meanwhile, as an alternative to cryptographic methods, physical layer security (PLS) has been extensively studied as a means to realize secure wireless communication that is resistant to attacks by both classical and quantum computers, i.e., quantum-safe. While the prevailing approach to PLS has been based on classical algorithms, this could potentially be accelerated by the application of quantum algorithms. This paper examines the potential applications of various quantum algorithms, including quantum annealing, hybrid quantum-classical algorithms, and Grover-based algorithms, to the the PLS problems. In particular, we begin with a concise overview of their applications to physical layer techniques and then proceed to discuss their use in addressing the challenges of secret message transmission and secret key generation from wireless channels.

We consider a basic system to securely and remotely control many IoT devices. Specifically, we require that: 1) a system manager broadcasts information to IoT devices, e.g., wireless environment, only the designated devices can identify operations sent from the manager; 2) each IoT device can detect (malicious) manipulation of the broadcast information and hence prevents maliciously generated operations from being executed. In this paper, we introduce anonymous broadcast authentication (ABA) as a core cryptographic primitive of the basic remote-control system. Specifically, we formally define the syntax and security notions for ABA so that it achieves the above requirements. We then show provably-secure ABA constructions and their implementations to provide their practical performance. Our promising results show that the ABA constructions can remotely control devices over a typical wireless network within a second.

In this paper, we investigate the impact of a bit-labeling scheme on security performance of bit-interleaved coded modulation (BICM) systems for the Gaussian wiretap channel, where the concept of security gap plays an important role. To exemplify this, we present optimization algorithms of bit-labeling, where a difference of the achievable information rates (AIRs) for the legitimate receiver and the eavesdropper is maximized. Our results demonstrate that the conventional Gray labeling may not be necessarily optimal in terms of security gap, and the proposed bit-labeling can significantly improve its performance at the cost of degradation in the achievable bit-error rate (BER) performance by the legitimate receiver. We also demonstrate that, for high order quadrature amplitude modulation (QAM), such as 64QAM, the dimension-wise optimization of bit-labeling may be sufficient to achieve similar security gap performance to the direct two-dimensional optimization. The proposed bit-labeling optimization approach can be combined with the state-of-the-art coding schemes to further reduce a security gap.

We introduce group-testing aggregate message authentication code (GTA MAC) and provide its formal study. We first specify its syntax and security requirements. Then, we present a scheme of generic construction which applies non-adaptive group-testing to aggregate MAC. We also confirm the security of the generic construction based on that of underlying aggregate MAC and a useful property of matrices representing non-adaptive group-testing. In addition, we instantiate the generic construction using the aggregate MAC scheme proposed by Katz and Lindell or a scheme using a cryptographic hash function for aggregating tags. Finally, we present some implementation results to show the effectiveness of our proposed GTA MAC.