Related papers: Quantum Optimal Multiple Assignment Scheme for Rea…
Semiquantum key distribution allows a quantum party to share a random key with a "classical" party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this…
There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access…
A scheme is proposed for simultaneous intraportation of many unknown quantum states within a quantum computing network. It is shown that our scheme, much different from the teleportation in the strict sense, can be very similar to the…
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…
We explore a generalization of quantum secret sharing (QSS) in which classical shares play a complementary role to quantum shares, exploring further consequences of an idea first studied by Nascimento, Mueller-Quade and Imai (Phys. Rev.…
We propose a symmetric key homomorphic encryption scheme based on the evaluation of multivariate polynomials over a finite field. The proposed scheme is somewhat homomorphic with respect to addition and multiplication. Further, we define a…
Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A69(04)052319], we propose a $(n,n)$-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage…
We demonstrate the possibility of controlling the success probability of a secret sharing protocol using a quantum cloning circuit. The cloning circuit is used to clone the qubits containing the encoded information and {\em en route} to the…
In a recent paper [Z. J. Zhang and Z. X. Man, Phys. Rev. A 72, 022303(2005)], a multiparty quantum secret sharing protocol based on entanglement swapping was presented. However, as we show, this protocol is insecure in the sense that an…
We study a simple graph-based classical secret sharing scheme: every player's share consists of a random key together with the encryption of the secret with the keys of his neighbours. A characterisation of the authorised and forbidden sets…
In recent times, secure quantum communication in layered networks has emerged as an important area of study. In this paper, we harness the potential offered by multidimensional states in secure quantum communication with only one quantum…
This paper introduces the Symmetric Extensible Quantum Secret Sharing protocol, which is a novel quantum protocol for secret sharing. At its heart, it is an entanglement based protocol that relies on the use of maximally entangled GHZ…
A theoretical quantum key distribution scheme using EPR pairs is presented. This scheme is efficient in that it uses all EPR pairs in distributing the key except those chosen for checking eavesdroppers. The high capacity is achieved because…
Quantum Key Distribution is a quantum communication technique in which random numbers are encoded on quantum systems, usually photons, and sent from one party, Alice, to another, Bob. Using the data sent via the quantum signals,…
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…
Secret sharing is a fundamental primitive in cryptography, and it can be achieved even with perfect security. However, the distribution of shares requires computational assumptions, which can compromise the overall security of the protocol.…
In this work we address the issue of sharing a quantum secret over untrusted channels between the dealer and players. Existing methods require entanglement over a number of systems which scales with the security parameter, quickly becoming…
An efficient quantum secret sharing scheme is proposed. In this scheme, the particles in an entangled pair group form two particle sequences. One sequence is sent to Bob and the other is sent to Charlie after rearranging the particle…
Encryption schemes attempt to provide a means for entities to communicate confidentially over a public channel. Such schemes have been studied for centuries, and their use has become widespread. However, developments in the area of quantum…
Public-key cryptosystems for quantum messages are considered from two aspects: public-key encryption and public-key authentication. Firstly, we propose a general construction of quantum public-key encryption scheme, and then construct an…