English
Related papers

Related papers: Revisiting controlled quantum secure direct commun…

200 papers

Currently used digital signatures based on asymmetric cryptography will be vulnerable to quantum computers running Shor's algorithm. In this work, we propose a new quantum-assisted digital signature protocol based on symmetric keys…

Inspired from quantum key distribution, we consider wireless communication between Alice and Bob when the intermediate space between Alice and Bob is controlled by Eve. That is, our model divides the channel noise into two parts, the noise…

Information Theory · Computer Science 2024-09-10 Masahito Hayashi

We propose a distributed quantum dense coding protocol that uses a control system to superpose two dense coding processes, allowing us to simultaneously and coherently encode and non-classically route the sender's single-qubit system to two…

Quantum Physics · Physics 2025-03-21 Pratham Hullamballi , Aparajita Bhattacharyya , Ujjwal Sen

The classical theories of communication rely on the assumption that there has to be a flow of particles from Bob to Alice in order for him to send a message to her. We develop a quantum protocol that allows Alice to perceive Bob's message…

Quantum Physics · Physics 2017-05-17 David Roland Miran Arvidsson-Shukur , Crispin Henry William Barnes

We show how continuous variable systems can allow the direct communication of messages with an acceptable degree of privacy. This is possible by combining a suitable phase-space encoding of the plain message with real-time checks of the…

Quantum Physics · Physics 2008-12-03 Stefano Pirandola , Samuel L. Braunstein , Stefano Mancini , Seth Lloyd

We introduce a quantum key distribution protocol designed to expose fake users that connect to Alice or Bob for the purpose of monopolising the link and denying service. It inherently resists attempts to exhaust Alice and Bob's initial…

Quantum Physics · Physics 2017-11-15 Alasdair B. Price , John G. Rarity , Chris Erven

Quantum key distribution allows two parties, traditionally known as Alice and Bob, to establish a secure random cryptographic key if, firstly, they have access to a quantum communication channel, and secondly, they can exchange classical…

Quantum Physics · Physics 2007-05-23 Matthias Christandl , Renato Renner , Artur Ekert

Blind quantum computation (BQC) allows a client (Alice), who only possesses relatively poor quantum devices, to delegate universal quantum computation to a server (Bob) in such a way that Bob cannot know Alice's inputs, algorithm, and…

Quantum Physics · Physics 2016-05-11 Yuki Takeuchi , Keisuke Fujii , Rikizo Ikuta , Takashi Yamamoto , Nobuyuki Imoto

Analyzing carefully an experimentally feasible non-entangled single qubit quantum secret sharing protocol and its modified version [Phys. Rev. Lett. 95, 230505 (2005); ibid. 98, 028902 (2007)], it is found that both versions are insecure…

Quantum Physics · Physics 2011-03-07 Guang Ping He , Z. D. Wang

We analyze the performance of continuous-variable quantum key distribution protocols where the entangled source originates not from one of the trusted parties, Alice or Bob, but from the malicious eavesdropper in the middle. This is in…

Quantum Physics · Physics 2013-02-20 Christian Weedbrook

This paper presents a new quantum protocol designed to simultaneously transmit information from one source to many recipients. The proposed protocol, which is based on the phenomenon of entanglement, is completely distributed and is…

Quantum Physics · Physics 2025-03-14 Theodore Andronikos , Alla Sirokofskich

Recently Liu, Long, Tong and Li [Phys. Rev. A 65, 022304 (2002)] have proposed a scheme for superdense coding between multiparties. This scheme seems to be highly asymmetric in the sense that only one sender effectively exploits…

Quantum Physics · Physics 2009-11-07 Andrzej Grudka , Antoni Wojcik

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

We assess the security of a quantum key distribution protocol relying on the transmission of Gaussian-modulated coherent states and homodyne detection. This protocol is shown to be equivalent to a squeezed state protocol based on a CSS code…

Quantum Physics · Physics 2009-11-10 S. Iblisdir , G. Van Assche , N. J. Cerf

This paper proposes a new protocol for quantum dense key distribution. This protocol embeds the benefits of a quantum dense coding and a quantum key distribution and is able to generate shared secret keys four times more efficiently than…

Recently, Shi et al. (Phys. Rev. A, 2015) proposed Quantum Oblivious Set Member Decision Protocol (QOSMDP) where two legitimate parties, namely Alice and Bob, play a game. Alice has a secret $k$ and Bob has a set $\{k_1,k_2,\cdots k_n\}$.…

Quantum Physics · Physics 2018-06-28 Arpita Maitra

We propose a new proof method for direct coding theorems for wiretap channels where the eavesdropper has access to a quantum version of the transmitted signal on an infinite-dimensional Hilbert space and the legitimate parties communicate…

Information Theory · Computer Science 2025-03-25 Matthias Frey , Igor Bjelaković , Janis Nötzel , Sławomir Stańczak

Current quantum secure direct communication (QSDC) protocols guarantee communication security by estimating the error rates of photons in the X and Z bases. This take the reference frame calibration between communicating parties as a…

A protocol for multiparty quantum secret splitting (MQSS) with an ordered $N$ Einstein-Podolsky-Rosen (EPR) pairs and Bell state measurements is recently proposed by Deng {\rm et al.} [Phys. Lett. A 354(2006)190]. We analyzed the security…

Quantum Physics · Physics 2009-11-13 Hong-Fu Wang , Xin Ji , Shou Zhang

We show that covert secret key expansion is possible using a public authenticated classical channel and a quantum channel largely under control of an adversary, which we precisely define. We also prove a converse result showing that, under…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Matthieu R. Bloch