6
collaborators
2021–2022
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
1 Talk
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Quantum Lock: A Provable Quantum Communication Advantage | QCRYPT 2022 | regular | Kaushik Chakraborty, Mina Doosti, Chirag Wadhwa, Myrto Arapinis, Elham Kashefi |
1 Poster
| Title | Conference | Co-authors |
|---|---|---|
| QEnclave - A composable treatment of quantum trusted execution environments | QCRYPT 2021 | Elham Kashefi, Myrto Arapinis, Kaushik Chakraborty, Marc Kaplan |
We introduce a secure hardware device named a QEnclave that can secure the remote execution of quantum operations while only using classical controls. This device extends to quantum computing the classical concept of a secure enclave which isolates a computation from its environment to provide privacy and tamper-resistance. Remarkably, our QEnclave only performs single-qubit rotations, but can nevertheless be used to secure an arbitrary quantum computation even if the qubit source is controlled by an adversary. More precisely, attaching a QEnclave to a quantum computer, a remote client controlling the QEnclave can securely delegate its computation to the server solely using classical communication. We investigate the security of our QEnclave by modeling it as an ideal functionality named Remote State Rotation. We show that this resource allows blind delegated quantum computing with perfect security. Our proof relies on standard tools from delegated quantum computing. Working in the Abstract Cryptography framework, we show a construction of remote state preparation from remote state rotation preserving the security. An immediate consequence is the weakening of the requirements for blind delegated computation. While previous delegated protocols were relying on a client that can either generate or measure quantum states, we show that this same functionality can be achieved with a client that only transforms quantum states without generating or measuring them. Combined with known impossibility results for implementing remote state preparation with classical communication, our construction suggests a new way for blind secure delegated computation. Computational assumptions that circumvent this impossibility induce large overheads that prevent their practical use. But our approach does not increase the complexity of the problem, and relies on hardware assumptions that are already used in practice for classical computations. It hence provides a better way of implementing blind remote delegation on real quantum computing systems. |
||
Collaborators
| Co-author | Joint talks |
|---|---|
| Elham Kashefi | 2 |
| Kaushik Chakraborty | 2 |
| Myrto Arapinis | 2 |
| Chirag Wadhwa | 1 |
| Marc Kaplan | 1 |
| Mina Doosti | 1 |