English
Related papers

Related papers: A Quantum-Proof Non-Malleable Extractor, With Appl…

200 papers

Semi-quantum key distribution protocols are designed to allow two users to establish a secure secret key when one of the two users is limited to performing certain "classical" operations. There have been several such protocols developed…

Quantum Physics · Physics 2015-09-17 Walter O. Krawec

We show that, if the accessible information is used as a security quantifier, quantum channels with a certain symmetry can convey private messages at a tremendously high rate, as high as less than one bit below the rate of non-private…

Quantum Physics · Physics 2015-04-01 Cosmo Lupo , Seth Lloyd

Using quantum key distribution (QKD) protocols, a secret key is created between two distant users (transmitter and receiver) at a particular key rate. Quantum technology can facilitate secure communication for cryptographic applications,…

Quantum Physics · Physics 2026-01-09 Venkat Abhignan , Mohit Mittal , Aditi Das , Megha Shrivastava

From the minimal assumption of post-quantum semi-honest oblivious transfers, we build the first $\epsilon$-simulatable two-party computation (2PC) against quantum polynomial-time (QPT) adversaries that is both constant-round and black-box…

Cryptography and Security · Computer Science 2023-11-07 Nai-Hui Chia , Kai-Min Chung , Xiao Liang , Takashi Yamakawa

We treat secret key extraction when the eavesdropper has correlated quantum states. We propose quantum privacy amplification theorems different from Renner's, which are based on quantum conditional R\'{e}nyi entropy of order 1+s. Using…

Quantum Physics · Physics 2016-09-28 Masahito Hayashi

Quantum-proof randomness extractors are an important building block for classical and quantum cryptography as well as device independent randomness amplification and expansion. Furthermore they are also a useful tool in quantum Shannon…

Quantum Physics · Physics 2017-05-05 Mario Berta , Omar Fawzi , Volkher B. Scholz

A recent line of work initiated by Chiesa and Gur and further developed by Herman and Rothblum investigates the sample and communication complexity of verifying properties of distributions with the assistance of a powerful, knowledgeable,…

Data Structures and Algorithms · Computer Science 2026-04-14 Elbert Du , Cynthia Dwork , Pranay Tankala , Linjun Zhang

In this article we deal with the security of the BB84 quantum cryptography protocol over noisy channels using generalized privacy amplification. For this we estimate the fraction of bits needed to be discarded during the privacy…

Quantum Physics · Physics 2007-05-23 N. Lütkenhaus , Stephen M. Barnett

This paper investigates the achievable region and precoder design for multiple access wiretap (MAC-WT) channels, where each user transmits both secret and open (i.e., non-confidential) messages. All these messages are intended for the…

Information Theory · Computer Science 2023-06-22 Hao Xu , Kai-Kit Wong , Giuseppe Caire

Quantum computing devices can now perform sampling tasks which, according to complexity-theoretic and numerical evidence, are beyond the reach of classical computers. This raises the question of how one can efficiently verify that a quantum…

Quantum Physics · Physics 2025-04-29 David Gross , Dominik Hangleiter

Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications, often knowing who transmits a message to whom and when must also be kept hidden…

This paper suggests an improvement to the BB84 scheme in Quantum key distribution. The original scheme has its weakness in letting quantifiably more information gain to an eavesdropper during public announcement of unencrypted bases lists.…

Quantum Physics · Physics 2007-05-23 C. Sanjeevakumar , M. Kasi Rajan , L. Sudarsan , R. Venkatesh , N. Srinivasan

Quantum key distribution (QKD) enables the establishment of secret keys between users connected via a channel vulnerable to eavesdropping, with information-theoretic security, that is, independently of the power of a malevolent party. QKD…

The original two-way continuous-variable quantum-key-distribution (CV QKD) protocols [S. Pirandola, S. Mancini, S. Lloyd, and S. L. Braunstein, Nature Physics 4, 726 (2008)] give the security against the collective attack on the condition…

Quantum Physics · Physics 2012-10-16 Maozhu Sun , Xiang Peng , Yujie Shen , Hong Guo

A secret key shared through quantum key distribution between two cooperative players is secure against any eavesdropping attack allowed by the laws of physics. Yet, such a key can be established only when the quantum channel error rate due…

Quantum Physics · Physics 2007-05-23 H. F. Chau

In this paper, we consider the problem of secret key generation for multiple parties. Multi-user networks usually require a trusted party to efficiently distribute keys to the legitimate users and this process is a weakness against…

Cryptography and Security · Computer Science 2022-08-30 Ufuk Altun , Semiha T. Basaran , Gunes K. Kurt , Enver Ozdemir

Existing security proofs of quantum key distribution (QKD) suffer from two fundamental weaknesses. First, memory attacks have emerged as an important threat to the security of even device-independent quantum key distribution (DI-QKD),…

Quantum Physics · Physics 2020-07-14 Marcos Curty , Hoi-Kwong Lo

Measurement-device-independent quantum key distribution (MDI-QKD) provides us a powerful approach to resist all attacks at detection side. Besides the unconditional security, people also seek for high key generation rate, but MDI-QKD has…

Quantum Physics · Physics 2020-09-22 Yu-Fei Yan , Lan Zhou , Wei Zhong , Yu-Bo Sheng

Quantum secure direct communication is one of the important mode of quantum communication, which sends secret information through a quantum channel directly without setting up a prior key. Over the past decade, numerous protocols have been…

Quantum Physics · Physics 2017-06-13 Jianyong Hu , Mingyong Jing , Peng Zhang , Qiangqiang Zhang , Huifang Hou , Liantuan Xiao , Suotang Jia

We consider the privacy amplification properties of a sampling scheme in which a user's data is used in k steps chosen randomly and uniformly from a sequence (or set) of t steps. This sampling scheme has been recently applied in the context…

Machine Learning · Computer Science 2026-01-16 Vitaly Feldman , Moshe Shenfeld