Related papers: Quantum protocols for the millionaire problem with…
Quantum key-distribution protocols allow two honest distant parties to establish a common truly random secret key in the presence of powerful adversaries, provided that the two users share beforehand a short secret key. This pre-shared…
Blind quantum computation (BQC) protocol allows a client having partial quantum ability to delegate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation…
Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the…
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…
Recently, a quantum multi-party summation protocol based on the quantum Fourier transform has been proposed [Quantum Inf Process 17: 129, 2018]. The protocol claims to be secure against both outside and participant attacks. However, a…
Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long…
This paper presents a new scheme to distribute secret shares using two trusted third parties to increase security and eliminate the dependency on single trusted third party. This protocol for communication between a device and two trusted…
Quantum privacy comparison(QPC) plays an important role in secret ballot elections, private auctions and so on. To date, many multi-party QPC(MQPC) protocols have been proposed to compare the equality of $k(k\geq 3)$ participants. However,…
Quantum Private Comparison (QPC) allows us to protect private information during its comparison. In the past various three-party quantum protocols have been proposed that claim to work well under noisy conditions. Here we tackle the problem…
We propose a quantum key distribution (QKD) protocol that enables three parties agree at once on a shared common random bit string in presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze…
We derive complementarity relations for arbitrary quantum states of multiparty systems, of arbitrary number of parties and dimensions, between the purity of a part of the system and several correlation quantities, including entanglement and…
Ever since its inception, cryptography has been caught in a vicious circle: Cryptographers keep inventing methods to hide information, and cryptanalysts break them, prompting cryptographers to invent even more sophisticated encryption…
Private queries allow a user Alice to learn an element of a database held by a provider Bob without revealing which element she was interested in, while limiting her information about the other elements. We propose to implement private…
Lin et al. [S. Lin, F. Gao, Q.-y. Wen, F.-c. Zhu, Opt. Commun. 281 (2008) 4553] pointed that the multiparty quantum secret sharing protocol [Z.-j. Zhang, G. Gao, X. Wang, L.-f. Han, S.-h. Shi, Opt. Commun. 269 (2007) 418] is insecure and…
Secure communication is one of the key applications of quantum networks. In recent years, following the demands for identity protection in classical communication protocols, the need for anonymity has also emerged for quantum networks.…
In this paper, a three-party secure semiquantum summation protocol, which can calculate the modulo 2 addition of the private bits from one quantum participant and two classical participants, is constructed by only using single qubits as the…
We investigate the approximate quantum state sharing protocol based on random unitary channels, which is secure against any exterior or interior attackers in principle. Although the protocol leaks small information for a security parameter…
In a recent paper (Int. J. Quantum Inf. 17 (2019) 1950026), the authors discussed the shortcomings in the security of a quantum private comparison protocol that we previously proposed (Int. J. Quantum Inf. 15 (2017) 1750014). They also…
We present a three-stage quantum cryptographic protocol guaranteeing security in which each party uses its own secret key. Unlike the BB84 protocol, where the qubits are transmitted in only one direction and classical information exchanged…
A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and new sequences are ``refuelled'' from a shared provably…