Related papers: Security problem on arbitrated quantum signature s…
We present a scheme for three-party simultaneous quantum secure direct communication by using EPR pairs. In the scheme, three legitimate parties can simultaneously exchange their secret messages. It is also proved to be secure against the…
We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect…
Absolutely and asymptotically secure protocols for organizing an exam in a quantum way are proposed basing judiciously on multipartite entanglement. The protocols are shown to stand against common types of eavesdropping attack.
Quantum Digital Signatures (QDS) allow for the exchange of messages from one sender to multiple recipients, with the guarantee that messages cannot be forged or tampered with. Additionally, messages cannot be repudiated -- if one recipient…
Several quantum process algebras have been proposed and successfully applied in verification of quantum cryptographic protocols. All of the bisimulations proposed so far for quantum processes in these process algebras are state-based,…
We present a quantum probabilistic encryption algorithm for a private-key encryption scheme based on conjugate coding of the qubit string. A probabilistic encryption algorithm is generally adopted in public-key encryption protocols. Here we…
In this letter, first, we investigate the security of a continuous-variable quantum cryptographic scheme with a postselection process against individual beam splitting attack. It is shown that the scheme can be secure in the presence of the…
To detect frauds from some internal participants or external attackers, some verifiable threshold quantum secret sharing schemes have been proposed. In this paper, we present a new verifiable threshold structure based on a single qubit…
Quotable signature schemes are digital signature schemes with the additional property that from the signature for a message, any party can extract signatures for (allowable) quotes from the message, without knowing the secret key or…
An authentic digital signature scheme based on the correlation of Greenberger-Horne-Zeilinger (GHZ) states was presented. In this scheme, by performing a local unitary operation on the third particles of each GHZ triplet, Alice can encode…
We show that a family of quantum authentication protocols introduced in [Barnum et al., FOCS 2002] can be used to construct a secure quantum channel and additionally recycle all of the secret key if the message is successfully…
One of the earliest cryptographic applications of quantum information was to create quantum digital cash that could not be counterfeited. In this paper, we describe a new type of quantum money: quantum coins, where all coins of the same…
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure…
The advantage of quantum protocols lies in the inherent properties of the shared quantum states. These states are sometimes provided by sources that are not trusted, and therefore need to be verified. Finding secure and efficient quantum…
An unconditionally secure authority-certified anonymous quantum key distribution scheme using conjugate coding is presented, base on which we construct a quantum election scheme without the help of entanglement state. We show that this…
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…
We construct general schemes for multi-partite quantum secret sharing using multi-level systems, and find that the consistent conditions for valid measurements can be summarized in two simple algebraic conditions. The scheme using the very…
A feasible, secure and collusion-attack-free quantum sealed-bid auction protocol is proposed using a modified scheme for multi-party circular quantum key agreement. In the proposed protocol, the set of all ($n$) bidders is grouped in to $l$…
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of…
We analyse the security of some variants of the CFS code-based digital signature scheme. We show how the adoption of some code-based hash-functions to improve the efficiency of CFS leads to the ability of an attacker to produce a forgery…