Related papers: Quantum m-out-of-n Oblivious Transfer
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…
Very recently, Lee et al. proposed the first secure quantum teleporation protocol, where quantum information shared by an arbitrary number of senders can be transferred to another arbitrary number of receivers. Here, by introducing quantum…
We present a simplified framework for proving sequential composability in the quantum setting. In particular, we give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition…
In this letter, we concentrate on the very recently proposed Measurement Device Independent Quantum Key Distribution (MDI QKD) protocol by Lo, Curty and Qi (PRL, 2012). We study how one can suitably present an eavesdropping strategy on MDI…
In this paper, we study the influence of non-abelian superselection rules on the transfer of quantum information with the help of qubits on the base of an algebraic model and formulate quantum protocols. We pay the main attention to the…
We present a linear optics quantum computation scheme that employs a new encoding approach that incrementally adds qubits and is tolerant to photon loss errors. The scheme employs a circuit model but uses techniques from cluster state…
We propose a quantum secret sharing scheme between $m$-party and $n$-party using three conjugate bases, i.e. six states. A sequence of single photons, each of which is prepared in one of the six states, is used directly to encode classical…
Blind quantum computation (BQC) protocol allows a client having partial quantum ability to delegate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation…
A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening…
Quantum coin tossing (QCT) is an important primitive of quantum cryptography and has received continuous interest. However, in practical QCT, Bob's detectors can be subjected to detector-side channel attacks launched by dishonest Alice,…
We propose a protocol for anonymous distribution of quantum information which can be used in two modifications. In the first modification the receiver of the message is publicly known, but the sender remains unknown (even to receiver). In…
We consider the implementation of two-party cryptographic primitives based on the sole assumption that no large-scale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit…
We introduce an explicit construction for a key distribution protocol in the Quantum Computational Timelock (QCT) security model, where one assumes that computationally secure encryption may only be broken after a time much longer than the…
The Quantum Private Query is a quantum cryptographic protocol to recover information from a database, preserving both user and data privacy: the user can test whether someone has retained information on which query was asked, and the…
We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the…
We propose a new quantum key distribution scheme that uses the blind polarization basis. In our scheme the sender and the receiver share key information by exchanging qubits with arbitrary polarization angles without basis reconciliation.…
One-sided output secure function evaluation is a cryptographic primitive where the two mutually distrustful players, Alice and Bob, both have a private input to a bivariate function. Bob obtains the value of the function for the given…
Blind quantum computation (BQC) allows a client (Alice), who only possesses relatively poor quantum devices, to delegate universal quantum computation to a server (Bob) in such a way that Bob cannot know Alice's inputs, algorithm, and…
We propose a scheme of quantum secret sharing between Alices' group and Bobs' group with single photons and unitary transformations. In the protocol, one member in Alices' group prepares a sequence of single photons in one of four different…
Secret sharing, in which a dealer wants to split a secret in such a way that any unauthorized subset of parties is unable to reconstruct it, plays a key role in cryptography. The security of quantum protocols for the task is guaranteed by…