TY - GEN
T1 - Randomly Rotate Qubits, Compute and Reverse for Weak Measurements Resilient QKD and Securing Entanglement
T2 - 5th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2021
AU - Bitan, Dor
AU - Dolev, Shlomi
N1 - Funding Information:
We would like to thank the Lynne and William Frankel Center for Computer Science, the Rita Altura Trust Chair in Computer Science. This research was also partially supported by a grant from the Ministry of Science and Technology, Israel & the Japan Science and Technology Agency (JST), and the German Research Funding (DFG, Grant#8767581199). We also thank Daniel Berend for discussions, comments and suggestions throughout the research.
Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021/1/1
Y1 - 2021/1/1
N2 - Homomorphic encryption (HE) schemes enable the processing of encrypted data and may be used by a user to outsource storage and computations to an untrusted server. A plethora of HE schemes has been suggested in the past four decades, based on various assumptions, which achieve different attributes. In this work, we assume that the user and server are quantum computers and look for HE schemes of classical data. We set a high bar of requirements and ask what can be achieved under these requirements. Namely, we look for HE schemes which are efficient, information-theoretically secure, perfectly correct, and which support homomorphic operations in a fully compact and non-interactive way. Fully compact means that decryption costs O(1 ) time and space. We suggest an encryption scheme based on random bases and discuss the homomorphic properties of that scheme. The main advantage of our scheme is providing better security in the face of weak measurements (WM). Measurements of this kind enable collecting partial information on a quantum state while only slightly disturbing the state. We suggest here a novel QKD scheme based on our encryption scheme, which is resilient against WM-based attacks. We bring up a new concept we call securing entanglement. We look at entangled systems of qubits as a resource used for carrying out quantum computations and show how our scheme may be used to guarantee that an entangled system can be used only by its rightful owners. To the best of our knowledge, this concept has not been discussed in previous literature.
AB - Homomorphic encryption (HE) schemes enable the processing of encrypted data and may be used by a user to outsource storage and computations to an untrusted server. A plethora of HE schemes has been suggested in the past four decades, based on various assumptions, which achieve different attributes. In this work, we assume that the user and server are quantum computers and look for HE schemes of classical data. We set a high bar of requirements and ask what can be achieved under these requirements. Namely, we look for HE schemes which are efficient, information-theoretically secure, perfectly correct, and which support homomorphic operations in a fully compact and non-interactive way. Fully compact means that decryption costs O(1 ) time and space. We suggest an encryption scheme based on random bases and discuss the homomorphic properties of that scheme. The main advantage of our scheme is providing better security in the face of weak measurements (WM). Measurements of this kind enable collecting partial information on a quantum state while only slightly disturbing the state. We suggest here a novel QKD scheme based on our encryption scheme, which is resilient against WM-based attacks. We bring up a new concept we call securing entanglement. We look at entangled systems of qubits as a resource used for carrying out quantum computations and show how our scheme may be used to guarantee that an entangled system can be used only by its rightful owners. To the best of our knowledge, this concept has not been discussed in previous literature.
KW - Information-theoretic security
KW - Quantum homomorphic encryption
KW - Quantum key distribution
KW - Securing entanglement
KW - Weak measurements
UR - http://www.scopus.com/inward/record.url?scp=85112000226&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-78086-9_15
DO - 10.1007/978-3-030-78086-9_15
M3 - Conference contribution
AN - SCOPUS:85112000226
SN - 9783030780852
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 196
EP - 204
BT - Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Proceedings
A2 - Dolev, Shlomi
A2 - Margalit, Oded
A2 - Pinkas, Benny
A2 - Schwarzmann, Alexander
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 8 July 2021 through 9 July 2021
ER -