Experimental Demonstration of Quantum Fully Homomorphic Encryption with Application in a Two-Party Secure Protocol

@article{Tham2020ExperimentalDO,
  title={Experimental Demonstration of Quantum Fully Homomorphic Encryption with Application in a Two-Party Secure Protocol},
  author={W. K. Tham and Hugo Ferretti and Kent Bonsma-Fisher and Aharon Brodutch and Barry C. Sanders and Aephraim M. Steinberg and Stacey Jeffery},
  journal={Physical Review X},
  year={2020},
  volume={10},
  pages={11038}
}
A fully homomorphic encryption system hides data from unauthorized parties while still allowing them to perform computations on the encrypted data. Aside from the straightforward benefit of allowing users to delegate computations to a more powerful server without revealing their inputs, a fully homomorphic cryptosystem can be used as a building block in the construction of a number of cryptographic functionalities. Designing such a scheme remained an open problem until 2009, decades after the… Expand
A framework for quantum homomorphic encryption with experimental demonstration
TLDR
A framework for (interactive) QHE based on the universal circuit approach, which contains a subprocedure of calculating a classical linear polynomial, which can be implemented with quantum or classical methods; apart from the subprocesure, the framework has low requirement on the quantum capabilities of the party who provides the circuit. Expand
Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme
Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universalExpand
Locking the Design of Building Blocks for Quantum Circuits
TLDR
This study explores the risk of outsourcing the quantum circuit to the quantum computer by focusing on quantum oracles, and investigates how to manage that on a quantum computer server using the IBM project QX quantum computer and Qiskit tools as an exemplar. Expand
Do qubits dream of entangled sheep
TLDR
This work extends the definition of measurement to account for observers with quantum memories who need not experience the world in the way the authors do, and defines measurements without probabilities, and shows that information gain and uncertainty can still be quantified in a meaningful way. Expand
Experimental quantum memristor
Michele Spagnolo,1 Joshua Morris,1 Simone Piacentini,2, 3 Michael Antesberger,1 Francesco Massa,1 Francesco Ceccarelli,3, 2 Andrea Crespi,2, 3 Roberto Osellame,3, 2 and Philip Walther1, 4 ViennaExpand

References

SHOWING 1-10 OF 87 REFERENCES
Quantum Homomorphic Encryption for Polynomial-Sized Circuits
TLDR
A new scheme for quantum homomorphic encryption which is compact and allows for efficient evaluation of arbitrary polynomial-sized quantum circuits, and a three-round scheme for blind delegated quantum computation which puts only very limited demands on the quantum abilities of the client. Expand
A quantum approach to homomorphic encryption
TLDR
This work uses the centralizer of a subgroup of operations to present a private-key quantum homomorphic encryption scheme that enables a broad class of quantum computation on encrypted data. Expand
Classical Homomorphic Encryption for Quantum Circuits
  • U. Mahadev
  • Computer Science, Mathematics
  • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
TLDR
The scheme allows a classical client to blindly delegate a quantum computation to a quantum server: an honest server is able to run the computation while a malicious server is unable to learn any information about the computation. Expand
Quantum computing on encrypted data.
TLDR
It is proved that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. Expand
Fully Homomorphic Encryption without bootstrapping
  • M. Yagisawa
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • 2015
TLDR
This book provides the new fully homomorphic encryption scheme without “bootstrapping” which runs fast for practical use and is immune from the attacks by the quantum computers. Expand
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
TLDR
This work formally defines and gives schemes for quantum homomorphic encryption, which is the encryption of quantum information such that quantum computations can be performed given the ciphertext only. Expand
(Leveled) Fully Homomorphic Encryption without Bootstrapping
TLDR
A new way of constructing leveled, fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits of a-priori bounded depth), without Gentry’s bootstrapping procedure is presented. Expand
A fully homomorphic encryption scheme
TLDR
This work designs a somewhat homomorphic "boostrappable" encryption scheme that works when the function f is the scheme's own decryption function, and shows how, through recursive self-embedding, bootstrappable encryption gives fully homomorphic encryption. Expand
Demonstration of Blind Quantum Computing
TLDR
An experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer is presented and the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server is exploited. Expand
Advances in Cryptology – CRYPTO 2013
TLDR
A substantial enhancement of the “ring-switching” procedure of Gentry et al. (SCN 2012) is extended, which is a natural method for homomorphically evaluating a broad class of structured linear transformations, including one that lets us evaluate the decryption function efficiently. Expand
...
1
2
3
4
5
...