Encrypting problem instances: Or ... can you take advantage of someone without having to trust him?
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
On hiding information form an oracle
Journal of Computer and System Sciences
Quantum computation and quantum information
Quantum computation and quantum information
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Efficient and provably secure aggregation of encrypted data in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Computing arbitrary functions of encrypted data
Communications of the ACM
Universal Blind Quantum Computation
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
A fully homomorphic encryption scheme
A fully homomorphic encryption scheme
Secure two-party quantum evaluation of unitaries against specious adversaries
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Secure assisted quantum computation
Quantum Information & Computation
Data obfuscation with network coding
Computer Communications
New quantum private comparison protocol using EPR pairs
Quantum Information Processing
On constructing homomorphic encryption schemes from coding theory
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Quantum private comparison protocol with d-dimensional Bell states
Quantum Information Processing
Efficient quantum private comparison employing single photons and collective detection
Quantum Information Processing
Quantum private comparison against decoherence noise
Quantum Information Processing
Quantum private comparison protocol based on entanglement swapping of $$d$$-level Bell states
Quantum Information Processing
| Hi-index | 0.00 |
Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any $$n$$n-qubit state that has been encrypted. Compared with classical homomorphic encryption, the QFHE scheme has perfect security. Finally, we also construct a QOTP-based symmetric QHE scheme, where the evaluate algorithm is independent of the secret key.