Narrow Results

This paper presents an analysis method for quantum information protocols based on model checking, with special focus on the quantum privacy comparison (QPC). The security properties of these protocols can be proved but in ways with much difficulty. Here we will discuss a probabilistic model checking tool — PRISM to verify specific properties of QPC protocol with multi-body and PRISM to verify specific properties of quantum private comparison (QPC) protocol with multi-party and d-dimensional entangled states.

Based on the logic Bell states, we present two novel multi-party quantum key agreement (QKA) protocols under collective noise. The proposed protocols make full use of four-qubit logic Bell states as quantum resources and perform the novel encoding operation to generate the shared key. The security analysis shows that these two protocols can resist against both participant and outsider attacks. Furthermore, compared with the other existing multi-party QKA protocols over collective noise, our protocols have higher qubit efficiency. Finally, we perform the simulation of the relationship between efficiency and security, which is completely consistent with the conclusion of the security analysis of the protocols.

A supply chain comprises several different kinds of actors that interact either in an ad hoc fashion (e.g. an eventual deal) or in a previously well-planned way. In the latter, how the interactions develop is described in contracts that are agreed on before the interactions start. This agreement may involve several partners, thus a multi-party contract is better suited than a set of bi-lateral contracts. If one is willing to negotiate automatically such kind of contracts, an appropriate negotiation protocol should be at hand. However, the ones for bi-lateral contracts are not suitable for multi-party contracts, e.g. the way to achieve consensus when only two negotiators are haggling over some issues is quite different if there are several negotiators involved. In the first case, a simple bargain would suffice, but in the latter a ballot process is needed. This paper briefly presents our negotiation protocol for electronic multi-party contracts which seamlessly combines several negotiation styles. It also elaborates on the main negotiation patterns the protocol allows for: bargain (for peer-to-peer negotiation), auction (when there is competition among the negotiators) and ballot (when the negotiation aims at consensus) and presents other patterns that can be built on these basic ones. Finally, it describes an implementation of this protocol based on Web services, and built on the YAWL Workflow Management System.

Symmetric Dicke states are a generalization of W-states that display interesting properties. These properties enable one to generate arbitrarily large symmetric Dicke states using operations on finite (2k) number of qubits. This paper formulates explicitly some basic results needed for this purpose. These results are synthesized into a generic Scalable Entangling Protocol. Examples are provided to illustrate the approach generality. A concomitant graphical representation allows fast comprehension of the protocol inputs, operations and outcomes.