Exploiting Quantum Gates in Secure Computation
| Autor: | Ernesto Damiani, Stelvio Cimato, Maryam Ehsanpour, Valentina Ciriani |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Theoretical computer science
Computer science Boolean circuit Computation 020206 networking & telecommunications 02 engineering and technology Quantum gate Computer engineering Logic gate 0202 electrical engineering electronic engineering information engineering Secure multi-party computation 020201 artificial intelligence & image processing Protocol (object-oriented programming) Hardware_LOGICDESIGN Electronic circuit Quantum computer |
| Zdroj: | DSD |
| DOI: | 10.1109/dsd.2017.53 |
| Popis: | Secure Multi-party Computation (SMC) has been introduced to allow the computation of generic functions between two parties that want to keep secret the input they use, and share only the computed result. One of the approach proposed to solve the SMC problem relies on the design of Garbled Circuits (GC), that are Boolean circuits that can be evaluated collaboratively achieving the SMC goal. Recently, there is a growing interest on the efficiency of this technique and on its potential applications to computation outsourcing in untrusted environments. One of the possible ways to reduce the complexity of the computation is to lower the number of non-EXOR gates in the Boolean circuit, since those gates have no cost for the execution of the secure computation protocol. In this work, we discuss the possibility to construct Garbled Circuit using quantum gates (QG), observing that, in some cases, the quantum GC requires a lower number of non-EXOR gates with respect to the corresponding classical GC implementations, thus improving the overall efficiency of the execution of the SMC protocol. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|