A rational secret sharing scheme is a game in which each party responsible for reconstructing a secret tries to maximize his utility by obtaining the secret alone. Quantum secret sharing schemes, either derived from quantum teleportation or from quantum error correcting code, do not succeed when we assume rational participants. This is because all existing quantum secret sharing schemes consider that the secret is reconstructed by a party chosen by the dealer. In this paper, for the first time, we propose a quantum secret sharing scheme which is resistant to rational parties. The proposed scheme is fair (everyone gets the secret), correct and achieves strict Nash equilibrium.

In Quantum Private Query (QPQ), a client obtains values corresponding to his query only and nothing else from the server and the server does not get any information about the queries. Giovannetti et al. (Phys. Rev. Lett., 2008) gave the first QPQ protocol and since then quite a few variants and extensions have been proposed. However, none of the existing protocols are device independent, i.e., all of them assume implicitly that the entangled states supplied to the client and the server are of certain form. In this work, we exploit the idea of a local CHSH game and connect it with the scheme of Yang et al. (Quantum Inf. Process., 2014) to present the concept of device independent QPQ protocol for the first time.

We obtain the most general ensemble of qubits, for which it is possible to design a universal Hadamard gate. These states when geometrically represented on the Bloch sphere, give a new trajectory. We further consider some Hadamard 'type' of operations and find ensembles of states for which such transformations hold. Unequal superposition of a qubit and its orthogonal complement is also investigated.

Very recently, the experimental demonstration of Quantum Secure Direct Communication (QSDC) with state-of-the-art atomic quantum memory has been reported (Phys. Rev. Lett., 2017). Quantum Dialogue (QD) falls under QSDC where the secrete messages are communicated simultaneously between two legitimate parties. The successful experimental demonstration of QSDC opens up the possibilities for practical implementation of QD protocols. Thus, it is necessary to analyze the practical security issues of QD protocols for future implementation. Since the very first proposal for QD by Nguyen (Phys. Lett. A, 2004) a large number of variants and extensions have been presented till date. However, all of those leak half of the secret bits to the adversary through classical communications of the measurement results. In this direction, motivated by the idea of Lo et al. (Phys. Rev. Lett., 2012), we propose a Measurement Device Independent Quantum Dialogue (MDI-QD) scheme which is resistant to such information leakage as well as side channel attacks. In the proposed protocol, Alice and Bob, two legitimate parties, are allowed to prepare the states only. The states are measured by an untrusted third party (UTP) who may himself behave as an adversary. We show that our protocol is secure under this adversarial model. The current protocol does not require any quantum memory and thus it is inherently robust against memory attacks. Such robustness might not be guaranteed in the QSDC protocol with quantum memory (Phys. Rev. Lett., 2017).

No abstract