English
Related papers

Related papers: Shared Secret Key Generation via Carrier Frequency…

200 papers

We consider distillation of secret bits from partially secret noisy correlations P_ABE, shared between two honest parties and an eavesdropper. The most studied distillation scenario consists of joint operations on a large number of copies…

Cryptography and Security · Computer Science 2008-05-12 Nick S. Jones , Lluis Masanes

We consider a coded cooperative data exchange problem with the goal of generating a secret key. Specifically, we investigate the number of public transmissions required for a set of clients to agree on a secret key with probability one,…

Information Theory · Computer Science 2014-07-02 Thomas A. Courtade , Thomas R. Halford

We consider a group of $m$ trusted and authenticated nodes that aim to create a shared secret key $K$ over a wireless channel in the presence of an eavesdropper Eve. We assume that there exists a state dependent wireless broadcast channel…

Cryptography and Security · Computer Science 2016-04-11 Mahdi Jafari Siavoshani , Shaunak Mishra , Christina Fragouli , Suhas N. Diggavi

Quantum cryptography makes it possible to expand a short shared key (of e.g. 256 bits[1]) into an arbitrary long shared key. The novelty of quantum cryptography is that whenever a spy tries to eavesdrop the communication he causes…

Quantum Physics · Physics 2009-10-19 Thomas Durt , Alex Hermanne

Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the…

Quantum Physics · Physics 2011-11-01 Michel Boyer , Ran Gelles , Dan Kenigsberg , Tal Mor

This paper investigates the problem of source-channel coding for secure transmission with arbitrarily correlated side informations at both receivers. This scenario consists of an encoder (referred to as Alice) that wishes to compress a…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

A dealer aims to share a secret with participants so that only predefined subsets can reconstruct it, while others learn nothing. The dealer and participants access correlated randomness and communicate over a one-way, public, rate-limited…

Information Theory · Computer Science 2026-01-27 Rumia Sultana , Remi A. Chou

Secret sharing, in which a dealer wants to split a secret in such a way that any unauthorized subset of parties is unable to reconstruct it, plays a key role in cryptography. The security of quantum protocols for the task is guaranteed by…

Quantum Physics · Physics 2017-10-10 Kejin Wei , Xiuqing Yang , Haiqiang Ma , Changhua Zhu

We consider a pair-wise independent network where every pair of terminals in the network observes a common pair-wise source that is independent of all the sources accessible to the other pairs. We propose a method for secret key agreement…

Information Theory · Computer Science 2007-07-13 Chunxuan Ye , Alex Reznik

A basic two-terminal secret key generation model is considered, where the interactive communication rate between the terminals may be limited, and in particular may not be enough to achieve the maximum key rate. We first prove a…

Information Theory · Computer Science 2017-03-29 Jingbo Liu , Paul Cuff , Sergio Verdú

This paper develops a new physical layer framework for secure two-way wireless communication in the presence of a passive eavesdropper, i.e., Eve. Our approach achieves perfect information theoretic secrecy via a novel randomized scheduling…

Information Theory · Computer Science 2009-08-27 Aly El Gamal , Moustafa Youssef , Hesham El Gamal

A novel technique is devised to perform orthogonal state quantum key distribution. In this scheme, entangled parts of a quantum information carrier are sent from Alice to Bob through two quantum channels. However before the transmission,…

Quantum Physics · Physics 2009-11-10 Fe-Guo Deng , Gui Lu Long

In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and…

Information Theory · Computer Science 2010-04-07 Somayeh Salimi , Mahmoud Salmasizadeh , Mohammad Reza Aref

It is designed a new quantum cryptography protocol that generates various secret and secure keys of the same size of the transmitted qubits, implying zero information losses between the interlocutors. Besides, generates key swapping between…

Quantum Physics · Physics 2013-11-13 Eduin H Serna

In this work, we consider a complete covert communication system, which includes the source-model of a stealthy secret key generation (SSKG) as the first phase. The generated key will be used for the covert communication in the second phase…

Information Theory · Computer Science 2017-03-01 Pin-Hsun Lin , Carsten Rudolf Janda , Eduard Axel Jorswieck

Continuous variable quantum key distribution allows two legitimate parties to share a common secret key and encompasses reconciliation protocols. A relatively new reconciliation protocol, Arithmetic Reconciliation, presents low complexity…

We propose a new quantum key distribution scheme that is based on the optimum expectation values of maximally entangled Greenberger-Horne-Zeilinger states. Our protocol makes use of the degrees of freedom in continuously variable angles,…

Quantum Physics · Physics 2023-08-21 Hyung S. Choi , Ye Jin Han , Collin Kessinger , Qiaoren Wang

This paper studies a multiple-input multiple-output (MIMO) free-space optical (FSO) communication system employing continuous-variable quantum key distribution (CV-QKD), with the goal to support secret key transmission between two…

Information Theory · Computer Science 2026-02-23 Sushil Kumar , Soumya P. Dash , George C. Alexandropoulos

We investigate the physical layer security of uplink single-carrier frequency-division multiple-access (SC-FDMA) systems. Multiple users, Alices, send confidential messages to a common legitimate base-station, Bob, in the presence of an…

Networking and Internet Architecture · Computer Science 2018-05-15 Mohamed F. Marzban , Ahmed El Shafie , Naofal Al-Dhahir , Ridha Hamila

Secure transmission between two agents, Alice and Bob, over block fading channels can be achieved similarly to conventional hybrid automatic repeat request (HARQ) by letting Alice transmit multiple blocks, each containing an encoded version…

Cryptography and Security · Computer Science 2014-01-15 Stefano Tomasin , Nicola Laurenti