English
Related papers

Related papers: Maximal Correlation Secrecy

200 papers

The Gaussian quantum key distribution protocol based on coherent states and heterodyne detection [Phys. Rev. Lett. 93, 170504 (2004)] has the advantage that no active random basis switching is needed on the receiver's side. Its security is,…

Quantum Physics · Physics 2009-11-13 J. Sudjana , L. Magnin , R. Garcia-Patron , N. J. Cerf

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

We derive a device-independent quantum key distribution protocol based on synchronous correlations and their Bell inequalities. This protocol offers several advantages over other device-independent schemes including symmetry between the two…

Quantum Physics · Physics 2022-03-14 Nishant Rodrigues , Brad Lackey

We establish a one-shot strong converse bound for privacy amplification against quantum side information using trace distance as a security criterion. This strong converse bound implies that in the independent and identical scenario, the…

Quantum Physics · Physics 2022-02-22 Yu-Chen Shen , Li Gao , Hao-Chung Cheng

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

A communication protocol based on a Gaussian modulation of squeezed states in a single quadrature and measured via homodyne detection can completely eliminate information leakage to an eavesdropper in a pure-loss channel. However, the…

Quantum Physics · Physics 2021-07-21 Matthew S. Winnel , Nedasadat Hosseinidehaj , Timothy C. Ralph

The maximal correlation coefficient measures the linear correlation in a bipartite distribution and contraction coefficients measure how much information is lost under a noisy channel. Remarkably, Raginsky established a close relation…

Quantum Physics · Physics 2026-03-31 Ian George , Marco Tomamichel

This paper considers secure communication in buffer-aided cooperative wireless networks in the presence of one eavesdropper, which can intercept the data transmission from both the source and relay nodes. A new max-ratio relaying protocol…

Information Theory · Computer Science 2020-05-18 Jiayu Zhou , Deli Qiao , Haifeng Qian

The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. In this paper, we derive the exact exponent for the asymptotic decay of the small modification of the quantum state in smoothing the…

Quantum Physics · Physics 2023-06-02 Ke Li , Yongsheng Yao , Masahito Hayashi

Correlations of the type discussed by EPR in their original 1935 paradox for continuous variables exist for the quadrature phase amplitudes of two spatially separated fields. These correlations were experimentally reported in 1992. We…

Quantum Physics · Physics 2009-10-31 M. D. Reid

The Hirschfeld-Gebelein-R\'{e}nyi (HGR) maximal correlation and the corresponding functions have been shown useful in many machine learning scenarios. In this paper, we study the sample complexity of estimating the HGR maximal correlation…

Information Theory · Computer Science 2021-09-15 Shao-Lun Huang , Xiangxiang Xu

Imperfect secrecy in communication systems is investigated. Instead of using equivocation as a measure of secrecy, the distortion that an eavesdropper incurs in producing an estimate of the source sequence is examined. The communication…

Information Theory · Computer Science 2012-10-09 Curt Schieler , Eva C. Song , Paul Cuff , H. Vincent Poor

We have formerly introduced Deep Random Secrecy, a new cryptologic technique capable to ensure secrecy as close as desired from perfection against unlimited passive eavesdropping opponents. We have also formerly introduced an extended…

Cryptography and Security · Computer Science 2019-01-09 Thibault de Valroger

We study common randomness where two parties have access to i.i.d. samples from a known random source, and wish to generate a shared random key using limited (or no) communication with the largest possible probability of agreement. This…

Computational Complexity · Computer Science 2017-07-26 Badih Ghazi , T. S. Jayram

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

One of the main problems in cryptography is to give criteria to provide good comparators of cipher systems. The security of a cipher system must include the security of the algorithm, the security of the key generator and management module…

Cryptography and Security · Computer Science 2012-02-29 Nicolae Constantinescu

We consider information theoretic secret key agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the…

Information Theory · Computer Science 2015-06-01 Himanshu Tyagi , Shun Watanabe

In 2002, Russell and Wang proposed a definition of entropically security that was developed within the framework of secret key cryptography. An entropically-secure system is unconditionally secure, that is, unbreakable, regardless of the…

Cryptography and Security · Computer Science 2022-05-10 Boris Ryabko

We demonstrate that secure communication using coherent states is possible. The optimal eavesdropping strategy for an M-ry ciphering scheme shows that the minimum probability of error in a measurement for bit determination can be made…

We are interested in investigating the security of source encryption with a symmetric key under side-channel attacks. In this paper, we propose a general framework of source encryption with a symmetric key under the side-channel attacks,…

Information Theory · Computer Science 2022-05-05 Yasutada Oohama , Bagus Santoso