相关论文: Quantum secret sharing for general access structur…

Today's information society relies on cryptography to achieve security goals such as confidentiality, integrity, authentication, and non-repudiation for digital communications. Here, public-key cryptosystems play a pivotal role to share…

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…

Secret sharing allows a user to split a secret into many shares so that the secret can be recovered if, and only if, an authorized set of shares is collected. Although secret sharing typically does not require any computational hardness…

The problem of security of quantum key protocols is examined. In addition to the distribution of classical keys, the problem of encrypting quantum data and the structure of the operators which perform quantum encryption is studied. It is…

Several quantum protocols for data security having been proposed and, in general, they have different optical implementations. However, for the implementation of quantum protocols in optical networks, it is highly advantageous if the same…

This study proposes a multiparty mediated quantum secret sharing (MQSS) protocol that allows n restricted quantum users to share a secret via the assistance of a dishonest third-party (TP) with full quantum capabilities. Under the premise…

Fully homomorphic encryption enables arbitrary computation on encrypted data without decrypting the data. Here it is studied in the context of quantum information processing. Based on universal quantum circuit, we present a quantum fully…

Quantum public-key encryption [Gottesman; Kawachi et al., Eurocrypt'05] generalizes public-key encryption (PKE) by allowing the public keys to be quantum states. Prior work indicated that quantum PKE can be constructed from assumptions that…

Quantum secret sharing (QSS) is a protocol to split a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. In the scheme, three parties Alice, Bob and Charlie first share a…

We prove the security of quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, and the full power allowed by the rules of classical and…

We show the security of multi-user key establishment on a single line of quantum communication. More precisely, we consider a quantum communication architecture where the qubit generation and measurement happen at the two ends of the line,…

The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here we present an efficient solution to the quantum…

A generalization of quantum broadcasting protocol is presented. Here the goal is to copy an unknown input state into two subsystems which partially overlap. We show that the possibility of implementing these protocols strongly depends upon…

A quantum cryptographic protocol based in public key cryptography combinations and private key cryptography is presented. Unlike the BB84 protocol [1] and its many variants [2,3] two quantum channels are used. The present research does not…

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…

Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be…

With the rapid development of quantum computers the currently secure cryptographic protocols may not stay that way. Quantum mechanics provides means to create an inherently secure communication channel that is protected by the laws of…

In this letter we introduce the problem of secrecy reversibility. This asks when two honest parties can distill secret bits from some tripartite distribution $p_{XYZ}$ and transform secret bits back into $p_{XYZ}$ at equal rates using local…

Recently, Aaronson et al. (arXiv:2009.07450) showed that detecting interference between two orthogonal states is as hard as swapping these states. While their original motivation was from quantum gravity, we show its applications in quantum…

Quantum secret sharing is one of the most important and interesting quantum information processing task. In quantum secret sharing, information is split among several parties such that only one of them is able to recover the qubit exactly…