Related papers: A reconciliation approach to key generation based …
Quantum conference key agreement (CKA) enables key sharing among multiple trusted users with information-theoretic security. Currently, the key rates of most quantum CKA protocols suffer from the limit of the total efficiency among quantum…
While Large Language Models (LLMs) demonstrate remarkable capabilities, they remain susceptible to sophisticated, multi-step jailbreak attacks that circumvent conventional surface-level safety alignment by exploiting the internal generation…
Mutual exclusion is one of the most commonly used techniques to handle contention in concurrent systems. Traditionally, mutual exclusion algorithms have been designed under the assumption that a process does not fail while…
Quantum computing threatens the security foundations of consumer electronics (CE). Preparing the diverse CE ecosystem, particularly resource-constrained devices, for the post-quantum era requires quantitative understanding of…
Continuous-variable quantum key distribution holds the potential to generate high secret key rates, making it a prime candidate for high-rate metropolitan quantum network applications. However, despite these promising opportunities, the…
Learning with Errors (LWE) is a hard math problem underlying recently standardized post-quantum cryptography (PQC) systems for key exchange and digital signatures. Prior work proposed new machine learning (ML)-based attacks on LWE problems…
We experimentally demonstrate adaptive reconciliation for continuous-variable quantum key distribution over a turbulent free-space optical channel. Additionally, we propose a method for optimising the reconciliation efficiency, increasing…
This paper investigates the design of low-complexity error correction codes for the verification step in continuous variable quantum key distribution (CVQKD) systems. We design new coding schemes based on quasi-cyclic repeat-accumulate…
Although homomorphic encryption can be incorporated into neural network layers for securing machine learning tasks, such as confidential inference over encrypted data samples and encrypted local models in federated learning, the…
We compare three proof techniques for composable finite-size security of quantum key distribution under collective attacks, with emphasis on how the resulting secret-key rates behave at practically relevant block lengths. As a benchmark, we…
Large Language Models (LLMs) excel in natural language processing tasks but pose significant computational and memory challenges for edge deployment due to their intensive resource demands. This work addresses the efficiency of LLM…
Large Language Models (LLMs) typically rely on a large number of parameters for token embedding, leading to substantial storage requirements and memory footprints. In particular, LLMs deployed on edge devices are memory-bound, and reducing…
We develop a new approach for asymmetric LDPC-based information reconciliation in order to adapt to the current channel state and achieve better performance and scalability in practical resource-constrained QKD systems. The new scheme…
We show that replacing the usual sifting step of the standard quantum-key-distribution protocol BB84 by a one-way reverse reconciliation procedure increases its robustness against photon-number-splitting (PNS) attacks to the level of the…
Conference key agreement (CKA) is an information processing task where more than two parties want to share a common secret key. Here, we present a loss-resilient protocol for CKA, based on redundant encoding and error correction. Our…
Conventionally, secrecy is achieved using cryptographic techniques beyond the physical layer. Recent studies raise the interest of performing encryption within the physical layer by exploiting some unique features of the physical wireless…
Continuous-variable quantum key distribution holds the potential to generate high secret key rates, making it a prime candidate for high-rate metropolitan quantum network applications. However, despite these promising opportunities, the…
Compressing the KV cache is a required step to deploy large language models on edge devices. Current quantization methods compress storage but fail to reduce bandwidth as attention calculation requires dequantizing keys from INT4/INT8 to…
The Learning-With-Errors (LWE) problem is a fundamental computational challenge with implications for post-quantum cryptography and computational learning theory. Here we propose a quantum-classical hybrid algorithm with Ising model to…
As privacy concerns in AI technologies continue to grow, Homomorphic Encryption (HE) offers a way to perform computations on encrypted data without the need of decryption during operations. However, HE is limited to addition and…