English
Related papers

Related papers: An Equivalence Between Secure Network and Index Co…

200 papers

Standard quantum key distribution protocols are provably secure against eavesdropping attacks, if quantum theory is correct. It is theoretically interesting to know if we need to assume the validity of quantum theory to prove the security…

Quantum Physics · Physics 2009-11-10 Jonathan Barrett , Lucien Hardy , Adrian Kent

We consider a family of quantum communication protocols involving $N$ partners. We demonstrate the existence of a link between the security of these protocols against individual attacks by the eavesdropper, and the violation of some Bell's…

Quantum Physics · Physics 2009-11-07 Valerio Scarani , Nicolas Gisin

In coding schemes for the wire-tap channel or the broadcast channels with confidential messages, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be…

Information Theory · Computer Science 2012-06-01 Shun Watanabe , Yasutada Oohama

Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair. Another important aspect of a distributed storage network is its security.…

Information Theory · Computer Science 2015-03-19 Nihar B. Shah , K. V. Rashmi , P. Vijay Kumar

This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation…

Information Theory · Computer Science 2011-02-09 Hung D. Ly , Tie Liu , Yufei Blankenship

We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders…

Information Theory · Computer Science 2014-06-05 Moritz Wiese , Holger Boche

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

Shannon showed that to achieve perfect secrecy in point-to-point communication, the message rate cannot exceed the shared secret key rate giving rise to the simple one-time pad encryption scheme. In this paper, we extend this work from…

Information Theory · Computer Science 2020-05-29 Hongchao Zhou , Abbas El Gamal

Electronic information is increasingly often shared among entities without complete mutual trust. To address related security and privacy issues, a few cryptographic techniques have emerged that support privacy-preserving information…

Cryptography and Security · Computer Science 2013-09-23 Carlo Blundo , Emiliano De Cristofaro , Paolo Gasti

This paper characterizes the secret message capacity of three networks where two unicast sessions share some of the communication resources. Each network consists of erasure channels with state feedback. A passive eavesdropper is assumed to…

Information Theory · Computer Science 2018-10-16 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure…

Information Theory · Computer Science 2016-11-18 Ruoheng Liu , Yingbin Liang , H. Vincent Poor , Predrag Spasojevic

We introduce a protocol called ENCORE which simultaneously compresses and encrypts data in a one-pass process that can be implemented efficiently and possesses a number of desirable features as a streaming encoder/decoder. Motivated by the…

Cryptography and Security · Computer Science 2025-01-28 Joshua Cooper , Grant Fickes

The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper…

Information Theory · Computer Science 2016-11-17 Tao Cui , Tracey Ho , Joerg Kliewer

Based on $d$-dimensional quantum full homomorphic encryption, an efficient and secure quantum network coding protocol is proposed in this paper. First, a quantum full homomorphic encryption protocol is constructed utilizing $d$-dimensional…

Quantum Physics · Physics 2023-05-26 Ning Wang , Fei Gao , Song Lin

This paper studies interference channels with security constraints. The existence of an external eavesdropper in a two-user interference channel is assumed, where the network users would like to secure their messages from the external…

Information Theory · Computer Science 2009-05-04 O. Ozan Koyluoglu , Hesham El Gamal

It is natural in a quantum network system that multiple users intend to send their quantum message to their respective receivers, which is called a multiple unicast quantum network. We propose a canonical method to derive a secure quantum…

Quantum Physics · Physics 2020-03-31 Go Kato , Masaki Owari , Masahito Hayashi

Recently, physical layer security in the optical layer has gained significant traction. Security treats in optical networks generally impact the reliability of optical transmission. Linear Network Coding (LNC) can protect from both the…

Cryptography and Security · Computer Science 2015-10-26 Anna Engelmann , Admela Jukan

The quantum key distribution for multiparty is one of the essential subjects of study. Especially, without using entangled states, performing the quantum key distribution for multiparty is a critical area of research. For this purpose,…

Quantum Physics · Physics 2023-09-27 Min Namkung , Younghun Kwon

Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , H. Vincent Poor

It is known that given the real sum of two independent uniformly distributed lattice points from the same nested lattice codebook, the eavesdropper can obtain at most 1 bit of information per channel regarding the value of one of the…

Information Theory · Computer Science 2009-10-15 Xiang He , Aylin Yener