Search

We address the question of existence of private quantum channel for qubits encoded in polarization degrees of freedom of a photon, that remains secure even if multi-photon (instead of single-photon) pulse is emitted. We show that random unitary channel distributed according to SU(2) Haar measure has this property. Further we analyze the qubit unitary k-designs. We show they ensure security if the photons' parity of the source is guaranteed. Otherwise, the qubit unitary k-designs do not guarantee perfect security., Comment: 8 pages

In this report, we present a framework for implementing an arbitrary $n$-outcome generalized quantum measurement (POVM) on an $m$-qubit register as a sequence of two-outcome measurements requiring only single ancillary qubit. Our procedure offers a particular construction for the two-outcome partial measurements which can be composed into a full implementation of the measurement on any gate architecture. This implementation in general requires classical feedback; we present specific cases when this is not the case. We apply this framework on the unambiguous state discrimination and analyze possible strategies. In the simplest case, it gives the same construction as is known, if we opt for performing conclusiveness measurement first. However, it also offers possibility of performing measurement for one of the state outcomes first, leaving conclusiveness measurement for later. This shows flexibility of presented framework and opens possibilities for further optimization. We present discussion also on biased qubit case as well as general case of unambiguous quantum state discrimination in higher dimension., Comment: 27 pages, 8 figures

MEMICS provides a forum for doctoral students interested in applications of mathematical and engineering methods in computer science. Besides a rich technical programme (including invited talks, regular papers, and presentations), MEMICS also offers friendly social activities and exciting opportunities for meeting like-minded people. MEMICS submissions traditionally cover all areas of computer science (such as parallel and distributed computing, computer networks, modern hardware and its design, non-traditional computing architectures, information systems and databases, multimedia and graphics, verification and testing, computer security, as well as all related areas of theoretical computer science).

Expansion and amplification of weak randomness plays a crucial role in many security protocols. Using quantum devices, such procedure is possible even without trusting the devices used, by utilizing correlations between outcomes of parts of the devices. We show here how to extract random bits with an arbitrarily low bias from a single arbitrarily weak min-entropy source in a device independent setting. To do this we use Mermin devices that exhibit super-classical correlations. Number of devices used scales polynomially in the length of the random sequence $n$. Our protocol is robust, it can tolerate devices that malfunction with a probability dropping polynomially in $n$ at the cost of a minor increase of the number of devices used., Comment: 5 pages + 3 pages supplementary material

In usual security proofs of quantum protocols the adversary (Eve) is expected to have full control over any quantum communication between any communicating parties (Alice and Bob). Eve is also expected to have full access to an authenticated classical channel between Alice and Bob. Unconditional security against any attack by Eve can be proved even in the realistic setting of device and channel imperfection. In this Letter we show that the security of QKD protocols is ruined if one allows Eve to possess a very limited access to the random sources used by Alice. Such knowledge should always be expected in realistic experimental conditions via different side channels.

We introduce the notion of "non-malleability" of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we demand that no controlled modification of the encrypted state can be effected. We show that such a scheme is equivalent to a "unitary 2-design" [Dankert et al.], as opposed to normal encryption which is a unitary 1-design. Our other main results include a new proof of the lower bound of (d^2-1)^2+1 on the number of unitaries in a 2-design [Gross et al.], which lends itself to a generalization to approximate 2-design. Furthermore, while in prime power dimension there is a unitary 2-design with =< d^5 elements, we show that there are always approximate 2-designs with O(epsilon^{-2} d^4 log d) elements., Comment: 8 pages. Title changed in v2, a couple of mistakes corrected, the results are essentially unchanged; accepted for publication at J Math Phys

We addressed the question of optimality of private quantum channels. We have shown that the Shannon entropy of the classical key necessary to securely transfer the quantum information is lower bounded by the entropy exchange of the private quantum channel $\cal E$ and von Neumann entropy of the ciphertext state $\varrho^{(0)}$. Based on these bounds we have shown that decomposition of private quantum channels into orthogonal unitaries (if exists) is optimizing the entropy. For non-ancillary single qubit PQC we have derived the optimal entropy for arbitrary set of plaintexts. In particular, we have shown that except when the (closure of the) set of plaintexts contains all states, one bit key is sufficient. We characterized and analyzed all the possible single qubit private quantum channels for arbitrary set of plaintexts. For the set of plaintexts consisting of all qubit states we have characterized all possible approximate private quantum channels and we have derived the relation between the security parameter and the corresponding minimal entropy., Comment: no comment

The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is the ability to prove the information-theoretic security (ITS) of the established keys. As a key establishment primitive, QKD however does not provide a standalone security service in its own: the secret keys established by QKD are in general then used by a subsequent cryptographic applications for which the requirements, the context of use and the security properties can vary. It is therefore important, in the perspective of integrating QKD in security infrastructures, to analyze how QKD can be combined with other cryptographic primitives. The purpose of this survey article, which is mostly centered on European research results, is to contribute to such an analysis. We first review and compare the properties of the existing key establishment techniques, QKD being one of them. We then study more specifically two generic scenarios related to the practical use of QKD in cryptographic infrastructures: 1) using QKD as a key renewal technique for a symmetric cipher over a point-to-point link; 2) using QKD in a network containing many users with the objective of offering any-to-any key establishment service. We discuss the constraints as well as the potential interest of using QKD in these contexts. We finally give an overview of challenges relative to the development of QKD technology that also constitute potential avenues for cryptographic research., Comment: Revised version of the SECOQC White Paper. Published in the special issue on QKD of TCS, Theoretical Computer Science (2014), pp. 62-81

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 the second modification the sender is known, but the receiver is unknown (even to sender). Our protocol achieves this goal with unconditional security using classical anonymous message transfer proposed by Chaum as a subprotocol.

We study private quantum channels on a single qubit, which encrypt given set of plaintext states $P$. Specifically, we determine all achievable states $\rho^{(0)}$ (average output of encryption) and for each particular set $P$ we determine the entropy of the key necessary and sufficient to encrypt this set. It turns out that single bit of key is sufficient when the set $P$ is two dimensional. However, the necessary and sufficient entropy of the key in case of three dimensional $P$ varies continuously between 1 and 2 bits depending on the state $\rho^{(0)}$. Finally, we derive private quantum channels achieving these bounds. We show that the impossibility of universal NOT operation on qubit can be derived from the fact that one bit of key is not sufficient to encrypt qubit., Comment: 23 pages, submitted to QI&C

We generalize the entanglement swapping scheme originally proposed for two pairs of qubits to an arbitrary number $q$ of systems composed from an arbitrary number $m_j$ of qudits. Each of the system is supposed to be prepared in a maximally entangled state of $m_j$ qudits, while different systems are not correlated at all. We show that when a set $\sum_{j=1}^q a_j$ particles (from each of the $q$ systems $a_j$ particles are measured) are subjected to a generalized Bell-type measurement, the resulting set of $\sum_{j=1}^q (m_j-a_j)$ particles will collapse into a maximally entangled state., Comment: 7 revtex pages, 4 figures

We prove that all purifications of a non-factorable state (i.e., the state which cannot be expressed in a form $\rho_{AB}=\rho_A\otimes\rho_B$) are entangled. We also show that for any bipartite state there exists a pair of measurements which are correlated on this state if and only if the state is non-factorable., Comment: 4 revtex pages, to appear in Phys. Rev. A