English
Related papers

Related papers: Multipartite Secret Correlations and Bound Informa…

200 papers

We study the relation between distillability of multipartite states and violation of Bell's inequality. We prove that there exist multipartite bound entangled states (i.e. non-separable, non-distillable states) that violate a multipartite…

Quantum Physics · Physics 2009-11-07 W. Dür

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

A multiparty computation protocol is described in which the parties can generate different probability events that is based on the sharing of a single anonymized random number, and also perform oblivious transfer. A method to verify the…

Cryptography and Security · Computer Science 2015-06-01 Subhash Kak

Establishing quantum correlations between two remote parties by sending an information carrier is an essential step of many protocols in quantum information processing. We obtain trade-off relations between discords and coherence within a…

Quantum Physics · Physics 2022-03-25 Zhi-Xiang Jin , Xianqing Li-Jost , Shao-Ming Fei , Cong-Feng Qiao

Bound entanglement is a special form of quantum entanglement that cannot be used for distillation, i.e., the local transformation of copies of arbitrarily entangled states into a smaller number of approximately maximally entangled states.…

Quantum Physics · Physics 2025-08-01 Beatrix C. Hiesmayr , Christopher Popp , Tobias C. Sutter

In this paper, we investigate how constraints on the randomization in the encoding process affect the secrecy rates achievable over wiretap channels. In particular, we characterize the secrecy capacity with a rate-limited local source of…

Information Theory · Computer Science 2012-02-27 Matthieu R. Bloch , Joerg Kliewer

A source model of key sharing between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. There are rate-limited public channels for communications between the users. We give…

Information Theory · Computer Science 2015-12-31 Somayeh Salimi , Panos Papadimitratos

One of the remarkable features of quantum mechanics is the ability to ensure secrecy. Private states embody this effect, as they are precisely those multipartite quantum states from which two parties can produce a shared secret that cannot…

Quantum Physics · Physics 2008-10-20 Joseph M. Renes , Jean-Christian Boileau

The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously…

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

The polarization phenomenon for a single source is extended to a framework with multiple correlated sources. It is shown in addition to extracting the randomness of the source, the polar transforms takes the original arbitrary dependencies…

Information Theory · Computer Science 2014-11-13 Emmanuel Abbe

We consider the secret key generation problem when sources are randomly excited by the sender and there is a noiseless public discussion channel. Our setting is thus similar to recent works on channels with action-dependent states where the…

Information Theory · Computer Science 2016-11-15 Tzu-Han Chou , Vincent Y. F. Tan , Stark C. Draper

Multi-secret sharing is an extension of secret sharing technique where several secrets are shared between the participants, each according to a specified access structure. The secrets can be reconstructed according to the access structure…

Cryptography and Security · Computer Science 2014-07-25 V. P. Binu , A. Sreekumar

The motivation for extending secret sharing schemes to cases when either the set of players is infinite or the domain from which the secret and/or the shares are drawn is infinite or both, is similar to the case when switching to abstract…

Cryptography and Security · Computer Science 2013-10-29 Alexander Dibert , László Csirmaz

We introduce a general model for the local obfuscation of probability distributions by probabilistic perturbation, e.g., by adding differentially private noise, and investigate its theoretical properties. Specifically, we relax a notion of…

Cryptography and Security · Computer Science 2023-07-19 Yusuke Kawamoto , Takao Murakami

A lossy source coding problem is studied in which a source encoder communicates with two decoders, one with and one without correlated side information with an additional constraint on the privacy of the side information at the uninformed…

Information Theory · Computer Science 2011-06-13 Ravi Tandon , Lalitha Sankar , H. Vincent Poor

Secret-key distillation from quantum states and channels is a central task of interest in quantum information theory, as it facilitates private communication over a quantum network. Here, we study the task of secret-key distillation from…

Quantum Physics · Physics 2025-06-16 Vishal Singh , Mark M. Wilde

When working with joint collections of confidential data from multiple sources, e.g., in cloud-based multi-party computation scenarios, the ownership relation between data providers and their inputs itself is confidential information.…

Cryptography and Security · Computer Science 2020-02-14 Kilian Becher , Thorsten Strufe

The distillable randomness of a bipartite quantum state is an information-theoretic quantity equal to the largest net rate at which shared randomness can be distilled from the state by means of local operations and classical communication.…

Quantum Physics · Physics 2023-07-06 Ludovico Lami , Bartosz Regula , Xin Wang , Mark M. Wilde

Secret sharing schemes based on the idea of hidden multipliers in encryption are proposed. As a platform, one can use both multiplicative groups of finite fields and groups of invertible elements of commutative rings, in particular,…

Cryptography and Security · Computer Science 2021-08-17 Vitaly Roman'kov

Secret Sharing techniques are now the building blocks of several security protocols. A (t;n) threshold secret sharing scheme is one in which t or more participant can join together to retrieve the secret.Traditional single secret sharing…

Cryptography and Security · Computer Science 2016-04-01 V P Binu , A Sreekumar
‹ Prev 1 4 5 6 7 8 10 Next ›