Write, autoreview, editor, reviewer
3,125
edits
Classical Fully Homomorphic Encryption for Quantum Circuits: Difference between revisions
Classical Fully Homomorphic Encryption for Quantum Circuits (edit)
Revision as of 16:57, 22 September 2018
, 22 September 2018→Setup Assumptions
| Line 32: | Line 32: | ||
===Setup Assumptions=== | ===Setup Assumptions=== | ||
* HE is a classical leveled fully homomorphic encryption scheme which is quantum capable for depth Lc. | * HE is a classical leveled fully homomorphic encryption scheme which is quantum capable for depth Lc. | ||
* A BQP Server can generate a superposition of inputs for the encryption function over some distribution given the public key used for encryption. | * A BQP Server can generate a superposition of inputs for the encryption function over some distribution given the public key used for encryption. The protocol takes the learning with errors assumption. | ||
===Security Claim/ Theorems=== | ===Security Claim/ Theorems=== | ||
*''Quantum Capable'' A classical HE is quantum capable i.e. can perform quantum computation efficiently if there exists AltHE which can execute natural XOR operations. | *''Quantum Capable'' A classical HE is quantum capable i.e. can perform quantum computation efficiently if there exists AltHE which can execute natural XOR operations. | ||