ECG Biometric Authentication Using Self-Supervised Learning for IoT Edge Sensors.

Wearable Internet of Things (IoT) devices are gaining ground for continuous physiological data acquisition and health monitoring. These physiological signals can be used for security applications to achieve continuous authentication and user convenience due to passive data acquisition. This paper investigates an electrocardiogram (ECG) based biometric user authentication system using features derived from the Convolutional Neural Network (CNN) and self-supervised contrastive learning. Contrastive learning enables us to use large unlabeled datasets to train the model and establish its generalizability. We propose approaches enabling the CNN encoder to extract appropriate features that distinguish the user from other subjects. When evaluated using the PTB ECG database with 290 subjects, the proposed technique achieved an authentication accuracy of 99.15%. To test its generalizability, we applied the model to two new datasets, the MIT-BIH Arrhythmia Database and the ECG-ID Database, achieving over 98.5% accuracy without any modifications. Furthermore, we show that repeating the authentication step three times can increase accuracy to nearly 100% for both PTBDB and ECGIDDB. This paper also presents model optimizations for embedded device deployment, which makes the system more relevant to real-world scenarios. To deploy our model in IoT edge sensors, we optimized the model complexity by applying quantization and pruning. The optimized model achieves 98.67% accuracy on PTBDB, with 0.48% accuracy loss and 62.6% CPU cycles compared to the unoptimized model. An accuracy-vs-time-complexity tradeoff analysis is performed, and results are presented for different optimization levels.

Autonomic end-to-end quality-of-service assurance over QKD-secured optical networks.

Quantum key distribution (QKD) provides future-proof security for data communications over optical networks. Currently, sophisticated QKD systems are developed and the scale of QKD-secured optical networks (QKD-ONs) becomes larger. Given the complex network conditions and dynamic end-to-end security services in QKD-ONs, autonomic management and control becomes a promising paradigm to support end-to-end quality-of-service (QoS) assurance in an efficient and stable way without requiring human intervention. Hence, to enable and utilize the autonomic functionalities over QKD-ONs for realizing the end-to-end QoS assurance becomes a challenge. This work enhances the software defined networking (SDN) technique to tackle this challenge because SDN can add programmability and flexibility for QKD-ON's management and control. A new architecture of SDN-based QKD-ONs supporting autonomic end-to-end QoS assurance is designed, where a knowledge engine with autonomic control loops is developed in the SDN controller. We present the autonomic end-to-end QoS assurance procedure, and the cross-layer collaborative QoS assurance (CLC-QA) strategy for implementing the autonomic functionalities in the network level over QKD-ONs. We also establish an experimental testbed of SDN-based QKD-ONs supporting autonomic end-to-end QoS assurance, and perform the numerical simulation to verify our proposed approaches. Experimental results demonstrate that our presented approaches can achieve the millisecond-level overall latency of 337 ms and 618 ms, during the first and second autonomic adjustment without human intervention in case of the autonomic QoS protection. Moreover, the CLC-QA strategy is evaluated under different traffic loads by being compared with the baseline strategy without cross-layer collaboration. It can improve 22.5% protection success ratio and save 5.7% average key consumption.

Multi-path-based quasi-real-time key provisioning in quantum-key-distribution enabled optical networks (QKD-ON).

With its information-theoretic security, quantum-key-distribution-enabled optical networks (QKD-ON) have become a promising candidate for future optical networks. The concept of quantum key pool (QKP) was introduced to offer an effective strategy for storing quantum keys. However, with the loss on its theoretical security due to storing these keys, balancing the storage of quantum keys and the security requirements of QKD-ONs poses a major challenge in their practical deployments. Hence, in this paper a concept of quasi-real-time key provisioning (QRT-KP) is introduced to address the tradeoff between quantum key storage and the degree of security. To satisfy the practical deployment of QRT-KP and the requirement of high-traffic flow, we propose a multi-path based QRT-KP (MP-QRT-KP) algorithm. Simulation results show that the MP-QRT-KP effectively enhances the performance of QKD-ONs in different scenarios, and it turns out that the algorithm performs better than single-path based QRT-KP (SP-QRT-KP) in terms of the success probability of key-allocation requests and key-resources utilization.

Auxiliary graph based routing, wavelength, and time-slot assignment in metro quantum optical networks with a novel node structure.

Nowadays, critical sectors in government, finance, and military are facing increasingly high security challenges. However, traditional public-key crypto-systems based on computational complexity are likely to suffer from upgrade computational power. Quantum key distribution (QKD) is a promising technology to effectively address the challenge by providing secret keys due to the laws of quantum physics. Limited by the transmission distance of quantum communications, remote parties have to share secret keys by exchanging keys through the trusted relay nodes hop by hop. However, if relaying hop by hop is still used in metro quantum-optical networks (MQON), a large amount of key resources will be wasted since the distance between any two nodes is short. Therefore, the problem of how to distribute quantum keys with lower waste of key resources over MQON is urgent. In order to solve this problem, we design a novel quantum node structure that is able to bypass itself. Also, by extending the connectivity graph, auxiliary graphs are constructed to describe the adjacency of quantum nodes in different levels influenced by the physical distance. Based on the novel node, two routing, wavelength and time-slot assignment algorithms are proposed, in which some middle nodes can be bypassed to reduce the resource consumption as long as the distance between the two parties meets the requirement of quantum key distribution. Simulations have been conducted to verify the performance of the proposed algorithms in terms of blocking probability, resource utilization, number of bypassed nodes, and security rate per service. Numerical results illustrate that our algorithms perform better on resource utilization than a traditional scheme without bypass. Furthermore, a tradeoff between the keys saved and blocking probability is analyzed and discussed in our paper.