English
Related papers

Related papers: Quantum secure non-malleable-extractors

200 papers

A quantum random number generator (QRNG) as a genuine source of randomness is essential in many applications, such as number simulation and cryptography. Recently, a source-independent quantum random number generator (SI-QRNG), which can…

Measurement-device-independent quantum key distribution (MDI-QKD) protocol has been demonstrated as a viable solution to detector side-channel attacks. One of the main advantages of MDI-QKD is that the security can be proved without making…

Quantum Physics · Physics 2015-04-14 Bing Qi

We introduce a systematic method for constructing polytope approximations to the quantum set in a variety of device-independent quantum random number generation (DI-QRNG) protocols. Our approach relies on two general-purpose algorithms that…

Quantum Physics · Physics 2026-03-11 Hyejung H. Jee , Florian J. Curchod , Mafalda L. Almeida

We present full generalisations of entropic security and entropic indistinguishability to the quantum world where no assumption but a limit on the knowledge of the adversary is made. This limit is quantified using the quantum conditional…

Quantum Physics · Physics 2010-04-16 Simon Pierre Desrosiers , Frédéric Dupuis

Randomness, mainly in the form of random numbers, is the fundamental prerequisite for the security of many cryptographic tasks. Quantum randomness can be extracted even if adversaries are fully aware of the protocol and even control the…

Quantum Physics · Physics 2023-03-24 Wen-Bo Liu , Yu-Shuo Lu , Yao Fu , Si-Cheng Huang , Ze-Jie Yin , Kun Jiang , Hua-Lei Yin , Zeng-Bing Chen

An extractor is a function E that is used to extract randomness. Given an imperfect random source X and a uniform seed Y, the output E(X,Y) is close to uniform. We study properties of such functions in the presence of prior quantum…

Quantum Physics · Physics 2008-02-04 Robert Koenig , Barbara M. Terhal

Randomness is a vital resource for modern day information processing, especially for cryptography. A wide range of applications critically rely on abundant, high quality random numbers generated securely. Here we show how to expand a random…

Quantum Physics · Physics 2016-11-02 Carl A. Miller , Yaoyun Shi

Secure multiparty computation (MPC) schemes allow two or more parties to conjointly compute a function on their private input sets while revealing nothing but the output. Existing state-of-the-art number-theoretic-based designs face the…

Quantum Physics · Physics 2024-07-18 Tapaswini Mohanty , Vikas Srivastava , Sumit Kumar Debnath , Pantelimon Stanica

We study quantum soft covering and privacy amplification against quantum side information. The former task aims to approximate a quantum state by sampling from a prior distribution and querying a quantum channel. The latter task aims to…

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

We present a security proof for establishing private entanglement by means of recurrence-type entanglement distillation protocols over noisy quantum channels. We consider protocols where the local devices are imperfect, and show that…

Quantum Physics · Physics 2017-11-20 Alexander Pirker , Vedran Dunjko , Wolfgang Dür , Hans J. Briegel

We analyze a cryptographic protocol for generating a distributed secret key from correlations that violate a Bell inequality by a sufficient amount, and prove its security against eavesdroppers, constrained only by the assumption that any…

Quantum Physics · Physics 2014-12-02 Ll. Masanes , R. Renner , M. Christandl , A. Winter , J. Barrett

The security of quantum key distribution (QKD) is severely threatened by discrepancies between realistic devices and theoretical assumptions. Recently, a significant framework called the reference technique was proposed to provide security…

Quantum Physics · Physics 2022-11-21 Jie Gu , Xiao-Yu Cao , Yao Fu , Zong-Wu He , Ze-Jie Yin , Hua-Lei Yin , Zeng-Bing Chen

Quantum key distribution can provide unconditionally secure key exchange for remote users in theory. In practice, however, in most quantum key distribution systems, quantum hackers might steal the secure keys by listening to the side…

Protecting secure random key from eavesdropping in quantum key distribution protocols has been well developed. In this letter, we further study how to detect and eliminate eavesdropping on the random base string in such protocols. The…

Quantum Physics · Physics 2007-06-27 Kai Wen , Fu Guo Deng , Gui Lu Long

Measurement-device-independent quantum key distribution (MDI-QKD) can eliminate all detector side-channel loopholes and has shown excellent performance in long-distance secret keys sharing. Conventional security proofs, however, require…

Quantum Physics · Physics 2022-02-09 Hua-Jian Ding , Xing-Yu Zhou , Chun-Hui Zhang , Jian Li , Qin Wang

The no-cloning principle of quantum mechanics enables us to achieve amazing unclonable cryptographic primitives, which is impossible in classical cryptography. However, the security definitions for unclonable cryptography are tricky.…

Quantum Physics · Physics 2024-05-21 Fuyuki Kitagawa , Ryo Nishimaki

Unclonable cryptography leverages the quantum no-cloning principle to copy-protect cryptographic functionalities. While most existing works address the basic single-copy security, the stronger notion of multi-copy security remains largely…

Quantum Physics · Physics 2025-10-15 Alper Çakan , Vipul Goyal , Fuyuki Kitagawa , Ryo Nishimaki , Takashi Yamakawa

Quantum secure direct communication (QSDC) is the technology to transmit secret information directly through a quantum channel without neither key nor ciphertext. It provides us with a secure communication structure that is fundamentally…

Quantum Physics · Physics 2018-05-21 Zeng-Rong Zhou , Yu-Bo Sheng , Peng-Hao Niu , Liu-Guo Yin , Gui-Lu Long

We study the problem of extracting random bits from weak sources that are sampled by algorithms with limited memory. This model of small-space sources was introduced by Kamp, Rao, Vadhan and Zuckerman (STOC'06), and falls into a line of…

Computational Complexity · Computer Science 2021-08-25 Eshan Chattopadhyay , Jesse Goodman

Non-malleable codes were introduced by Dziembowski, Pietrzak, and Wichs (JACM 2018) as a generalization of standard error correcting codes to handle severe forms of tampering on codewords. This notion has attracted a lot of recent research,…

Cryptography and Security · Computer Science 2018-11-05 Eshan Chattopadhyay , Xin Li
‹ Prev 1 4 5 6 7 8 10 Next ›