Information Theoretically Secure Encryption Key Generation over Wireless Networks by Exploiting Packet Errors

• URL: http://arxiv.org/abs/2402.05012v1
• Date: Wed, 7 Feb 2024 16:32:13 GMT
• Title: Information Theoretically Secure Encryption Key Generation over Wireless Networks by Exploiting Packet Errors
• Authors: Amir K. Khandani,
• Abstract summary: It exploits the fact that data transmission over wireless links is accompanied by packet error, while noise terms, and thereby the error events observed by two separate receivers are independent of each other. A method is presented for determining packets received error-free in first transmission attempts through high-level programming.
• Score: 3.8366697175402225
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This article presents a novel method for establishing an information theoretically secure encryption key over wireless channels. It exploits the fact that data transmission over wireless links is accompanied by packet error, while noise terms, and thereby the error events observed by two separate receivers are independent of each other. A number of data packets, with random data, are transmitted from a first legitimate node, say Alice, to a second legitimate node, say Bob. Bob identifies all packets that are received error-free in the first transmission attempt and sends their indices to Alice over a public channel. Then, both Alice and Bob mix the contents of identified packets, e.g., using a hash function, and thereby derive an identical encryption key. Since error events from Alice to Bob is independent of error events from Alice to Eve, the chances that Eve has successfully received all packets used in key generation error-free diminishes as the number of packet increases. In many wireless standards, the first stage in error detection and Automatic Repeat Request (ARQ) is deployed at the PHY/MAC (Physical Layer/Medium Access Control) layer. In such setups, the first re-transmission is manged by the PHY/MAC layer without informing higher layers. This makes it impossible to directly access the information related to packet errors through high-level programming interfaces available to an end-user. A method is presented for determining packets received error-free in first transmission attempts through high-level programming. Examples are presented in conjunction with an LTE cellular network.

Related papers

• Variational Secret Common Randomness Extraction [38.319927578257726]
  We study the problem of extracting common randomness (CR) or secret keys from correlated random sources observed by two legitimate parties, Alice and Bob, through public discussion in the presence of an eavesdropper, Eve.<n>We propose a practical two-stage CR extraction framework. In the first stage, Alice and Bob employ probabilistic neural network (NN) encoders to map their observations into discrete, nearly uniform random variables (RVs) with high agreement probability.<n>In the second stage, a secure sketch using code-offset construction reconciles the encoder outputs into identical secret keys, whose secrecy is guaranteed by the VPQ objective
  arXiv  Detail & Related papers  (2025-10-02T14:22:21Z)
• Conquering High Packet-Loss Erasure: MoE Swin Transformer-Based Video Semantic Communication [11.845717685362814]
  packet-loss-resistant MoE Swin Transformer-based Video Semantic Communication (MSTVSC) system is proposed in this paper.<n>To address this issue, a packet-loss-resistant MoE Swin Transformer-based Video Semantic Communication (MSTVSC) system is proposed in this paper.
  arXiv  Detail & Related papers  (2025-08-02T05:41:52Z)
• Joint Encryption and Error Correction for Secure Quantum Communication [0.0]
  We provide a single integrated process that allows for encryption as well as error correction.<n>This is a first attempt to do so for secure quantum communication.<n>It allows for arbitrary qubits to be transmitted from sender to receiver making the proposed protocol general purpose.
  arXiv  Detail & Related papers  (2025-05-23T17:42:03Z)
• Uncertain Location Transmitter and UAV-Aided Warden Based LEO Satellite Covert Communication Systems [33.78419893075842]
  We propose a novel covert communication system in which a ground user, Alice, transmits unauthorized message fragments to Bob, a low-Earth orbit satellite. We introduce two key performance metrics: catch probability (Willie detects and locates Alice during a message chunk transmission) and overall catch probability over multiple message chunks. We analyze how two parameters impact these metrics: 1) the size of the detection window and 2) the number of message chunks.
  arXiv  Detail & Related papers  (2025-04-14T15:55:31Z)
• Find A Winning Sign: Sign Is All We Need to Win the Lottery [52.63674911541416]
  We show that a sparse network trained by an existing IP method can retain its basin of attraction if its parameter signs and normalization layer parameters are preserved. To take a step closer to finding a winning ticket, we alleviate the reliance on normalization layer parameters by preventing high error barriers along the linear path between the sparse network trained by our method and its counterpart with normalization layer parameters.
  arXiv  Detail & Related papers  (2025-04-07T09:30:38Z)
• Hacking coherent-one-way quantum key distribution with present-day technology [0.0]
  Recent results have shown that the secret-key rate of coherent-one-way (COW) quantum key distribution (QKD) scales quadratically with the system's transmittance. This was proven by using a so-called zero-error attack, which relies on an unambiguous state discrimination (USD) measurement. Here, we investigate the feasibility and effectiveness of zero-error attacks against COW QKD with present-day technology.
  arXiv  Detail & Related papers  (2024-06-19T18:16:29Z)
• Randomized Key Encapsulation/Consolidation [3.8366697175402225]
  This article bridges the gap between two topics used in sharing an encryption key: Key Consolidation and Quantum-safe Key Encapsulation. The proposed scheme adds to the complexity Eve faces in extracting useful data from leaked information. It can even encapsulate a Quantum-safe encryption key in the extreme case that no common randomness is available.
  arXiv  Detail & Related papers  (2024-01-30T13:24:44Z)
• Random Segmentation: New Traffic Obfuscation against Packet-Size-Based Side-Channel Attacks [3.519713290901182]
  Despite encryption, the packet size is still visible, enabling observers to infer private information in the Internet of Things (IoT) environment. Packet padding obfuscates packet-length characteristics with a high data overhead because it relies on adding noise to the data. This paper proposes a more data-efficient approach that randomizes packet sizes without adding noise.
  arXiv  Detail & Related papers  (2023-09-12T03:33:36Z)
• QuTE: decentralized multiple testing on sensor networks with false discovery rate control [130.7122910646076]
  This paper designs methods for decentralized multiple hypothesis testing on graphs equipped with provable guarantees on the false discovery rate (FDR) We consider the setting where distinct agents reside on the nodes of an undirected graph, and each agent possesses p-values corresponding to one or more hypotheses local to its node. Each agent must individually decide whether to reject one or more of its local hypotheses by only communicating with its neighbors, with the joint aim that the global FDR over the entire graph must be controlled at a predefined level.
  arXiv  Detail & Related papers  (2022-10-09T19:48:39Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Two-way Unclonable Encryption with a vulnerable sender [2.355458445741348]
  Unclonable Encryption, introduced by Gottesman in 2003, is a quantum protocol that guarantees the secrecy of a successfully transferred classical message. We propose an Unclonable Encryption protocol with the additional property that the sender's key material is allowed to leak even in the case of an unsuccessful run.
  arXiv  Detail & Related papers  (2020-10-21T08:35:49Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• SoS-RPL: Securing Internet of Things Against Sinkhole Attack Using RPL Protocol-Based Node Rating and Ranking Mechanism [1.2691047660244335]
  IoTs are endowed with particular routing disobedience called sinkhole attack owing to their distributed features. In these attacks, a malicious node broadcasts illusive information regarding the routings to impose itself as a route towards specific nodes for the neighboring nodes and thus, attract data traffic. In this paper, the technique is assessed through wide simulations performed within the NS-3 environment. Based on the results of the simulation, it is indicated that the IoT network behavior metrics are enhanced based on the detection rate, false-negative rate, false-positive rate, packet delivery rate, maximum throughput, and packet loss rate.
  arXiv  Detail & Related papers  (2020-05-17T09:26:09Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.