Secure Multi Computing Research And Application Protocols

Wide application of computers and quick development of computing technology make security become one of the most important problems in computer science and technology. The applications of network technology to commerce and military affairs bring infinite chances for cooperative computing. Cooperative computing involves two or more parties who cooperate to finish a computing work. Cooperative algorithms can make the parties cooperate to process each party’s input to output an expected result. When these cooperative algorithms are applied among mutual distrusted parties, it becomes a crucial problem how to preserve the privacy of each party’s input. This is what secure multiparty computation tries to deal with.Secure multi-party computation is important in the field of cryptography and is closely related to the idea of zero-knowledge. In general, it refers to a computing protocol in which two parties or more cooperatively compute a function without the help of a trusted third party while preserve the privacy of each party’s input privacy. For example, n participantsP, P2,..., Pn, each has private datad1, d2,..., dn respectively, and they want to compute a public function F on n variables at the point(d1,d2,...,dn). Secure multiparty computation protect that no party can obtain more information than what he can obtain from his input and the function value.If a secure multiparty protocol is implemented with quantum mechanics manner, is called quantum secure multiparty computation. Quantum secure multiparty computation takes excellent advantages of quantum information technology to greatly enhance its security and to improve the communication efficiency. Most scholars believe that it is impossible to design an unconditionally secure quantum bit commitment protocol. Considering that a quantum Turing machine cannot determine a NPC problem, it is possible to design a computationally quantum secure multiparty computation protocol.This dissertation studies secure multiparty computation and how to blindly generate key. First we study how to securely computing intersection set of two private sets; then we study how to implement secure multiparty computation based on quantum mechanics. Furthermore, we use GUC secure model to study secure intersection set computing. In studying secure two party quantum computation problems, we adapt ADQC model and add a auxiliary quantum bit to enhance the security. Our main work includes:In studying secure set-intersection computation, we use anonymous identity based encryption and blink key generating technology to construct a general secure2-party set-intersection computation protocol. This construction is provably GUC (generalized universally composable) secure in standard model with acceptable efficiency. In addition, we present a blink key generating protocol based on efficient anonymous Boyen-Waters IBE scheme.In this paper, we propose a protocol for ancilla-driven universal blind quantum computation by incorporating the idea of teleportation-type quantum computation into "universal blind quantum computation" proposed by Broadbent et al. Our protocol can be regarded as a blind version of "ancilla-driven universal quantum computation" proposed by Anders et al and can improve its computing power. We use two-qubit measurements instead of the entangle operator to implement our computing.