English
Related papers

Related papers: Multipartite Secret Correlations and Bound Informa…

200 papers

We investigate the conditions under which a set of multipartite nonlocal correlations can describe the distributions achievable by distant parties conducting experiments in a consistent universe. Several questions are posed, such as: are…

Quantum Physics · Physics 2015-09-18 Ben Lang , Tamas Vertesi , Miguel Navascues

We show an eavesdropping scheme, by which the eavesdropper can achieve the full information of the key against the protocol [Kye et al., PRL 95 040501 (2005)] with a probability of unity and will not be discovered by the the legitimate…

Quantum Physics · Physics 2007-05-23 Qiang Zhang , Xiang-Bin Wang , Yu-Ao Chen , Tao Yang , Jian-Wei Pan

The partial information decomposition (PID) is a promising framework for decomposing a joint random variable into the amount of influence each source variable Xi has on a target variable Y, relative to the other sources. For two sources,…

Information Theory · Computer Science 2019-01-30 Ryan G. James , Jeffrey Emenheiser , James P. Crutchfield

An undetected eavesdropping attack must produce count rate statistics that are indistinguishable from those that would arise in the absence of such an attack. In principle this constraint should force a reduction in the amount of…

Quantum Physics · Physics 2007-05-23 G. Gilbert , M. Hamrick

This work addresses private communication with distributed systems in mind. We consider how to best use secret key resources and communication to transmit signals across a system so that an eavesdropper is least capable to act on the…

Cryptography and Security · Computer Science 2015-03-19 Paul Cuff

We study the problem of generating a shared secret key between two terminals in a joint source-channel setup -- the sender communicates to the receiver over a discrete memoryless wiretap channel and additionally the terminals have access to…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection between CSS-states and bipartite graph…

Information Theory · Computer Science 2008-04-05 Kai Chen , Hoi-Kwong Lo

We propose a new upper bound for the eavesdropper's information in the direct and reverse reconciliated coherent states quantum key distribution protocols with heterodyne detection. This bound is derived by maximizing the leaked information…

Quantum Physics · Physics 2009-02-17 Jerome Lodewyck , Philippe Grangier

A characterization of the complete correlation structure in an $n$-party system is proposed in terms of a series of $(k,n)$ threshold classical secret sharing protocols ($2\le k\le n$). The total correlation is shown to be the sum of…

Quantum Physics · Physics 2007-05-23 D. L. Zhou , L. You

We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external…

Information Theory · Computer Science 2013-07-05 Kittipong Kittichokechai , Yeow-Khiang Chia , Tobias J. Oechtering , Mikael Skoglund , Tsachy Weissman

We consider secret key generation from relative localization information of a pair of nodes in a mobile wireless network in the presence of a mobile eavesdropper. Our problem can be categorized under the source models of information…

Information Theory · Computer Science 2015-03-19 Onur Gungor , Fangzhou Chen , C. Emre Koksal

We introduce a new multiparty cryptographic protocol, which we call `entanglement sharing schemes', wherein a dealer retains half of a maximally-entangled bipartite state and encodes the other half into a multipartite state that is…

Quantum Physics · Physics 2013-03-18 Ran Hee Choi , Ben Fortescue , Gilad Gour , Barry C. Sanders

Information theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to…

Cryptography and Security · Computer Science 2016-11-15 Toni Draganov Stojanovski , Ninoslav Marina

We study the problem of rate-distortion-equivocation with side-information only available at the decoder when an independent private random key is shared between the sender and the receiver. The sender compresses the sequence, and the…

Information Theory · Computer Science 2022-01-25 Hamid Ghourchian , Photios A. Stavrou , Tobias J. Oechtering , Mikael Skoglund

A privacy-utility tradeoff is developed for an arbitrary set of finite-alphabet source distributions. Privacy is quantified using differential privacy (DP), and utility is quantified using expected Hamming distortion maximized over the set…

Information Theory · Computer Science 2018-08-02 Kousha Kalantari , Lalitha Sankar , Anand Sarwate

From the NP-hardness of the quantum separability problem and the relation between bipartite entanglement and the secret key correlations, it is shown that the problem deciding whether a given quantum state has secret correlations in it or…

Quantum Physics · Physics 2015-10-30 Jae-Weon Lee , DoYong Kwon , Jaewan Kim

A new generalised approach for multiple correlated sources over a wiretap network is investigated. A basic model consisting of two correlated sources where each produce a component of the common information is initially investigated. There…

Information Theory · Computer Science 2014-10-06 Reevana Balmahoon , Ling Cheng

A special feature of the ground state in a topologically ordered phase is the existence of large scale correlations depending only on the topology of the regions. These correlations can be detected by the topological entanglement entropy or…

Quantum Physics · Physics 2016-02-15 Kohtaro Kato , Fabian Furrer , Mio murao

We study differential privacy (DP) in a multi-party setting where each party only trusts a (known) subset of the other parties with its data. Specifically, given a trust graph where vertices correspond to parties and neighbors are mutually…

Cryptography and Security · Computer Science 2024-10-17 Badih Ghazi , Ravi Kumar , Pasin Manurangsi , Serena Wang

A multiple-access channel is considered in which messages from one encoder are confidential. Confidential messages are to be transmitted with perfect secrecy, as measured by equivocation at the other encoder. The upper bounds and the…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , Ivana Maric , Roy D. Yates , Predrag Spasojevic