Annual Cryptology Conference

CRYPTO 2010: Advances in Cryptology – CRYPTO 2010 pp 685-706

Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries

  • Frédéric Dupuis
  • Jesper Buus Nielsen
  • Louis Salvail
Conference paper

DOI: 10.1007/978-3-642-14623-7_37

Volume 6223 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Dupuis F., Nielsen J.B., Salvail L. (2010) Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. In: Rabin T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg

Abstract

We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call specious. Our construction requires two ideal functionalities to garantee privacy: a private SWAP between registers held by the two parties and a classical private AND-box equivalent to oblivious transfer. If the unitary to be evaluated is in the Clifford group then only one call to SWAP is required for privacy. On the other hand, any unitary not in the Clifford requires one call to an AND-box per R-gate in the circuit. Since SWAP is itself in the Clifford group, this functionality is universal for the private evaluation of any unitary in that group. SWAP can be built from a classical bit commitment scheme or an AND-box but an AND-box cannot be constructed from SWAP. It follows that unitaries in the Clifford group are to some extent the easy ones. We also show that SWAP cannot be implemented privately in the bare model.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Frédéric Dupuis
    • 1
  • Jesper Buus Nielsen
    • 2
  • Louis Salvail
    • 3
  1. 1.Institute for Theoretical PhysicsETH ZurichSwitzerland
  2. 2.DAIMIAarhus UniversityDenmark
  3. 3.Université de Montréal (DIRO)Canada