相关论文: Reply to Comment: Quantum Cryptography Based on Or…

The methods of quantum cryptography enable one to have perfectly secure communication lines, whereby the laws of quantum physics protect the privacy of the data exchanged. Each quantum-cryptography scheme has its own security criteria that…

Block ciphers are versatile cryptographic ingredients that are used in a wide range of applications ranging from secure Internet communications to disk encryption. While post-quantum security of public-key cryptography has received…

We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun. 283, 184 (2010)], which is built using only orthogonal states encoding the classical bits that are teleported from Alice to Bob, is…

The aim of this paper is to elucidate the implications of quantum computing in present cryptography and to introduce the reader to basic post-quantum algorithms. In particular the reader can delve into the following subjects: present…

Secure communication plays a crucial role in the Internet Age. Quantum mechanics may revolutionise cryptography as we know it today. In this Review Article, we introduce the motivation and the current state of the art of research in quantum…

The protocol for counterfactual transmission of a qubit [Li et al., Phys. Rev. A 92, 052315 (2015)] relies on the counterfactuality of transmissions of bit 1 and of bit 0. Since counterfactuality of transmission of bit 0 is not established,…

Bell's states are among the most useful in quantum computing. These state are an orthonormal base of entagled states with two qubits. We propose alternative bases of entangled states. Some of these states depend on a continuous parameter.…

Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are efficiently-computable quantum states that are computationally indistinguishable from Haar-random states. One-way functions imply the existence of pseudorandom states, but…

In a recent Letter (Phys. Rev. Lett. 95 (2005) 010503) Barrett, Hardy and Kent (BHK) considered a very interesting question which of the fundamental laws of physics ensure security of quantum cryptographic protocols. In particular, they…

Quantum cryptography is the only approach to privacy ever proposed that allows two parties (who do not share a long secret key ahead of time) to communicate with provably perfect secrecy under the nose of an eavesdropper endowed with…

We propose a new cryptographic protocol. It is suggested to encode information in ordinary binary form into many-qubit entangled states with the help of a quantum computer. A state of qubits (realized, e.g., with photons) is transmitted…

One can find some comments related to the isospectral issue

In this paper, we briefly show how the quantum key distribution with blind polarization bases [Kye et al., Phys. Rev. Lett. 95, 040501 (2005)] can be made secure against the impersonation attack.

This is a reply to the paper by S.C.Benjamin, quant-ph/0008127.

We reply to the comments on our paper "Quantum Confinement in Hydrogen Bond" (Int. J. Quantum Chem. 115 (2015) 765 DOI: 10.1002/qua.24894) made by Matthias Heger and Martin A. Suhm.

This is a reply to the comment from Patrick Bruno (arXiv:1211.4792) on our paper (Phys. Rev. Lett. 109, 163001 (2012)).

As quantum computing technology continues to advance, post-quantum cryptographic methods capable of resisting quantum attacks have emerged as a critical area of focus. Given the potential vulnerability of existing homomorphic encryption…

It is shown that (i) all entangled states can be mapped by single-copy measurements into probability distributions containing secret correlations, and (ii) if a probability distribution obtained from a quantum state contains secret…

The Goldenberg-Vaidman (GV) protocol for quantum key distribution (QKD) uses orthogonal encoding states of a particle. Its security arises because operations accessible to Eve are insufficient to distinguish the two states encoding the…

This is a reply to the Comment on 'Spin Decoherence in Superconducting Atom Chips' [arXiv:quant-ph/0610095 (2006)].