相关论文: More Robust Multiparty Protocols with Oblivious Tr…

A multi-party quantum key distribution protocol based on repetitive code is designed for the first time in this paper. First we establish a classical (t, n) threshold protocol which can authenticate the identity of the participants, and…

We propose a quantum authentication protocol that is robust against the theft of secret keys. In the protocol, disposable quantum passwords prevent impersonation attacks with stolen secret keys. The protocol also prevents the leakage of…

Can a sender non-interactively transmit one of two strings to a receiver without knowing which string was received? Does there exist minimally-interactive secure multiparty computation that only makes (black-box) use of symmetric-key…

In this document we describe the design of a multi-party messaging encryption protocol "Strongvelope". We hope that it will prove useful to people interested in understanding the inner workings of this protocol as well as cryptography and…

Proposed Bell pair swapping protocols, an essential component of the Quantum Internet, are planned-path: specific, structured, routing paths are reserved prior to the execution of the swapping process. This makes sense when one assumes the…

A multiparty session formalises a set of concurrent communicating participants. We propose a type system for multiparty sessions where some communications between participants can be ignored. This allows us to type some sessions with global…

It is of folkloric belief that the security of classical cryptographic protocols is automatically broken if the Adversary is allowed to perform superposition queries and the honest players forced to perform actions coherently on quantum…

Secure multi-party computation (MPC) is a broad cryptographic concept that can be adopted for privacy-preserving computation. With MPC, a number of parties can collaboratively compute a function, without revealing the actual input or output…

We present a tripartite three-level state that allows a secret sharing protocol among the three parties, or a quantum key distribution protocol between any two parties. The state used in this scheme contains entanglement even after one…

I construct a secure multi-party scheme to compute a classical function by a succinct use of a specially designed fault-tolerant random polynomial quantum error correction code. This scheme is secure provided that (asymptotically) strictly…

Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be stable if the number of…

Using unstable particles which decay by emitting neutrinos, we propose a quantum bit commitment protocol that is humanly impossible to break. Neutrinos carry away quantum information, but their interaction with matter is so weak that it…

The way a new type of state called a hybrid state, which contains more than one degree of freedom, is used in many practical applications of quantum communication tasks with lesser amount of resources. Similarly, our aim is here to perform…

The importance of being able to verify quantum computation delegated to remote servers increases with recent development of quantum technologies. In some of the proposed protocols for this task, a client delegates her quantum computation to…

The growing interest in reliable multi-party applications has fostered widespread adoption of Byzantine Fault-Tolerant (BFT) consensus protocols. Existing BFT protocols need f more replicas than Paxos-style protocols to prevent equivocation…

We present a protocol for transferring arbitrary continuous-variable quantum states into a few discrete-variable qubits and back. The protocol is deterministic and utilizes only two-mode Rabi-type interactions which are readily available in…

We propose a multiparty quantum cryptographic protocol. Unitary operators applied by Bob and Charlie, on their respective qubits of a tripartite entangled state encodes a classical symbol that can be decoded at Alice's end with the help of…

The laws of quantum mechanics allow for the distribution of a secret random key between two parties. Here we analyse the security of a protocol for establishing a common secret key between N parties (i.e. a conference key), using resource…

Ensuring the correctness of distributed system implementations remains a challenging and largely unaddressed problem. In this paper we present a protocol that can be used to certify the safety of consensus implementations. Our proposed…

The increasing sophistication of available quantum networks has seen a corresponding growth in the pursuit of multi-partite cryptographic protocols. Whilst the use of multi-partite entanglement is known to offer an advantage in certain…