A Simple Method for Secret-Key Generation Between Mobile Users Across Networks

• URL: http://arxiv.org/abs/2410.02964v1
• Date: Thu, 3 Oct 2024 20:09:30 GMT
• Title: A Simple Method for Secret-Key Generation Between Mobile Users Across Networks
• Authors: Yingbo Hua,
• Abstract summary: Two or more mobiles users can continuously superimpose sequences of bits chosen from different packets or files already exchanged and authenticated between themselves to continuously renew a secret key for continuous strengthening of their privacy and authentication. This accumulative, adaptable and additive (AAA) method is discussed in this paper.
• Score: 7.331799534004013
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Two or more mobiles users can continuously superimpose sequences of bits chosen from different packets or files already exchanged and authenticated between themselves to continuously renew a secret key for continuous strengthening of their privacy and authentication. This accumulative, adaptable and additive (AAA) method is discussed in this paper. The equivocation to Eve of any bit in the generated key by the AAA method equals to the probability that not all corresponding independent bits exchanged between the users are intercepted by Eve. This performance, achieved without using any knowledge of non-stationary probabilities of bits being intercepted by Eve, is compared to an established capacity achievable using that knowledge. A secrecy robustness of the AAA method against some correlations known to Eve is also discussed.

Related papers

• BiCert: A Bilinear Mixed Integer Programming Formulation for Precise Certified Bounds Against Data Poisoning Attacks [62.897993591443594]
  Data poisoning attacks pose one of the biggest threats to modern AI systems. Data poisoning attacks pose one of the biggest threats to modern AI systems. Data poisoning attacks pose one of the biggest threats to modern AI systems.
  arXiv  Detail & Related papers  (2024-12-13T14:56:39Z)
• FedHide: Federated Learning by Hiding in the Neighbors [12.71494268219787]
  We propose a prototype-based federated learning method designed for embedding networks in classification or verification tasks. Our approach generates proxy class prototypes by linearly combining them with their nearest neighbors. This technique conceals the true class prototype while enabling clients to learn discriminative embedding networks.
  arXiv  Detail & Related papers  (2024-09-12T07:37:49Z)
• Entanglement-assisted authenticated BB84 protocol [11.78752485991754]
  We present a novel authenticated Quantum Key Distribution (QKD) protocol employing maximally entangled qubit pairs.<n>In the absence of noise, we securely authenticate the BB84 QKD scheme under two assumptions.
  arXiv  Detail & Related papers  (2024-07-03T14:05:27Z)
• Security of hybrid BB84 with heterodyne detection [0.0]
  Quantum key distribution (QKD) promises everlasting security based on the laws of physics. Recent hybrid QKD protocols have been introduced to leverage advantages from both categories. We provide a rigorous security proof for a protocol introduced by Qi in 2021, where information is encoded in discrete variables.
  arXiv  Detail & Related papers  (2024-02-26T19:00:01Z)
• TernaryVote: Differentially Private, Communication Efficient, and Byzantine Resilient Distributed Optimization on Heterogeneous Data [50.797729676285876]
  We propose TernaryVote, which combines a ternary compressor and the majority vote mechanism to realize differential privacy, gradient compression, and Byzantine resilience simultaneously. We theoretically quantify the privacy guarantee through the lens of the emerging f-differential privacy (DP) and the Byzantine resilience of the proposed algorithm.
  arXiv  Detail & Related papers  (2024-02-16T16:41:14Z)
• 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)
• ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment [90.60126724503662]
  ByzSecAgg is an efficient secure aggregation scheme for federated learning. ByzSecAgg is protected against Byzantine attacks and privacy leakages.
  arXiv  Detail & Related papers  (2023-02-20T11:15:18Z)
• Sound and Complete Verification of Polynomial Networks [55.9260539566555]
  Polynomial Networks (PNs) have demonstrated promising performance on face and image recognition recently. Existing verification algorithms on ReLU neural networks (NNs) based on branch and bound (BaB) techniques cannot be trivially applied to PN verification. We devise a new bounding method, equipped with BaB for global convergence guarantees, called VPN.
  arXiv  Detail & Related papers  (2022-09-15T11:50:43Z)
• Understanding Clipping for Federated Learning: Convergence and Client-Level Differential Privacy [67.4471689755097]
  This paper empirically demonstrates that the clipped FedAvg can perform surprisingly well even with substantial data heterogeneity. We provide the convergence analysis of a differential private (DP) FedAvg algorithm and highlight the relationship between clipping bias and the distribution of the clients' updates.
  arXiv  Detail & Related papers  (2021-06-25T14:47:19Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Noiseless attack and counterfactual security of quantum key distribution [0.0]
  We show that the efficiency of counterfactual QKD protocols can be enhanced by including non-counterfactual bits. We show how this problem can be resolved in a simple way, whereby the non-counterfactual key bits are indicated to be secure. This method of enhancing the key rate is shown to be applicable to various existing quantum counterfactual key distribution protocols.
  arXiv  Detail & Related papers  (2020-12-09T16:48:43Z)
• Certified Robustness to Label-Flipping Attacks via Randomized Smoothing [105.91827623768724]
  Machine learning algorithms are susceptible to data poisoning attacks. We present a unifying view of randomized smoothing over arbitrary functions. We propose a new strategy for building classifiers that are pointwise-certifiably robust to general data poisoning attacks.
  arXiv  Detail & Related papers  (2020-02-07T21:28:30Z)

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.