An Efficient Hybrid Key Exchange Mechanism

• URL: http://arxiv.org/abs/2505.02499v1
• Date: Mon, 05 May 2025 09:28:46 GMT
• Title: An Efficient Hybrid Key Exchange Mechanism
• Authors: Benjamin D. Kim, Vipindev Adat Vasudevan, Alejandro Cohen, Rafael G. L. D'Oliveira, Thomas Stahlbuhk, Muriel Médard,
• Abstract summary: textscCHOKE is a code-based hybrid key-encapsulation mechanism (KEM)<n>We show that the communication cost of our construction is optimal under the requirement that each KEM must be used at least once.
• Score: 58.96805474751668
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We present \textsc{CHOKE}, a novel code-based hybrid key-encapsulation mechanism (KEM) designed to securely and efficiently transmit multiple session keys simultaneously. By encoding $n$ independent session keys with an individually secure linear code and encapsulating each resulting coded symbol using a separate KEM, \textsc{CHOKE} achieves computational individual security -- each key remains secure as long as at least one underlying KEM remains unbroken. Compared to traditional serial or combiner-based hybrid schemes, \textsc{CHOKE} reduces computational and communication costs by an $n$-fold factor. Furthermore, we show that the communication cost of our construction is optimal under the requirement that each KEM must be used at least once.

Related papers

• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [98.31540557973179]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• A Key Encapsulation Mechanism from Low Density Lattice Codes [0.0]
  Key Encapsulation Mechanisms (KEMs) are a set of cryptographic techniques that are designed to provide symmetric encryption key using asymmetric mechanism (public key)<n>This paper focuses on design and analysis of key encapsulation mechanism from low density lattice codes (KEM-LDLC) to go down the key size by keeping an acceptable level of security.
  arXiv  Detail & Related papers  (2024-12-06T11:56:25Z)
• Quantum-Safe Hybrid Key Exchanges with KEM-Based Authentication [2.102973349909511]
  In PQCrypto 2023, Bruckner, Ramacher and Striecks proposed a novel hybrid AKE (HAKE) protocol, dubbed Muckle+. Muckle# uses post-quantum key-encapsulating mechanisms for implicit authentication inspired by recent works in the area of Transport Layer Security (TLS) protocols.
  arXiv  Detail & Related papers  (2024-11-06T16:28:17Z)
• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• The Road to Near-Capacity CV-QKD Reconciliation: An FEC-Agnostic Design [53.67135680812675]
  A new codeword-based QKD reconciliation scheme is proposed. Both the authenticated classical channel (ClC) and the quantum channel (QuC) are protected by separate forward error correction (FEC) coding schemes. The proposed system makes QKD reconciliation compatible with a wide range of FEC schemes.
  arXiv  Detail & Related papers  (2024-03-24T14:47:08Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• CCA-Secure Hybrid Encryption in Correlated Randomness Model and KEM Combiners [3.837357895668154]
  A hybrid encryption (HE) system is an efficient public key encryption system for arbitrarily long messages. The HE encryption algorithm uses a KEM generated key k to encapsulate the message using DEM. The KEM/DEM composition theorem proves that if KEM and DEM satisfy well-defined security notions, then HE will be secure with well defined security.
  arXiv  Detail & Related papers  (2024-01-02T01:16:52Z)
• Hybrid Quantum Cryptography from Communication Complexity [0.43695508295565777]
  We build a key distribution protocol called HM-QCT from the Hidden Matching problem. We show that the security of HM-QCT against arbitrary i.i.d. attacks can be reduced to the difficulty of solving the underlying Hidden Matching problem. Remarkably, the scheme remains secure with up to $mathcalObig( fracsqrtnlog(n)big)$ input photons for each channel use.
  arXiv  Detail & Related papers  (2023-11-15T18:03:15Z)
• Efficient Nearest Neighbor Search for Cross-Encoder Models using Matrix Factorization [60.91600465922932]
  We present an approach that avoids the use of a dual-encoder for retrieval, relying solely on the cross-encoder. Our approach provides test-time recall-vs-computational cost trade-offs superior to the current widely-used methods.
  arXiv  Detail & Related papers  (2022-10-23T00:32:04Z)
• Permutation Compressors for Provably Faster Distributed Nonconvex Optimization [68.8204255655161]
  We show that the MARINA method of Gorbunov et al (2021) can be considered as a state-of-the-art method in terms of theoretical communication complexity. Theory of MARINA to support the theory of potentially em correlated compressors, extends to the method beyond the classical independent compressors setting.
  arXiv  Detail & Related papers  (2021-10-07T09:38:15Z)
• Everlasting Secure Key Agreement with performance beyond QKD in a Quantum Computational Hybrid security model [0.0]
  We introduce the textitQuantum Computational Hybrid (QCH) security model. We propose an explicit $d$-dimensional key distribution protocol, that we call MUB-textitQuantum Computational Timelock (MUB-QCT) We demonstrate that MUB-QCT enables everlasting secure key distribution with input states containing up to $O(sqrtd)$ photons.
  arXiv  Detail & Related papers  (2020-04-21T17:26:55Z)

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.