Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  • Frédéric Dupuis, Institute for Theoretical Physics, ETH Zürich, Switzerland
  • Jesper Buus Nielsen
  • Louis Salvail, Université de Montréal, Canada
  • Department of Computer Science
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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Pages (from-to)685-706
Number of pages12
Publication statusPublished - 2010
Event30th Annual International Cryptology Conference. CRYPTO 2010 - Santa Barbare, CA, United States
Duration: 15 Aug 201019 Aug 2010


Conference30th Annual International Cryptology Conference. CRYPTO 2010
CountryUnited States
CitySanta Barbare, CA

Bibliographical note

Title of the vol.: Advances in cryptology -CRYPTO 2010. Proceedings / ed. by Tal Rabin.
ISBN: 3642146228; 9783642146220

See relations at Aarhus University Citationformats

ID: 22304424