Ouyang, Y. orcid.org/0000-0003-1115-0074, Tan, S.-H., Zhao, L. et al. (1 more author) (2017) Computing on quantum shared secrets. Physical Review A, 96 (5). 052333. ISSN 2469-9926
Abstract
A (k,n)-threshold secret-sharing scheme allows for a string to be split into n shares in such a way that any subset of at least k shares suffices to recover the secret string, but such that any subset of at most k-1 shares contains no information about the secret. Quantum secret-sharing schemes extend this idea to the sharing of quantum states. Here we propose a method of performing computation securely on quantum shared secrets. We introduce a (n,n)-quantum secret sharing scheme together with a set of algorithms that allow quantum circuits to be evaluated securely on the shared secret without the need to decode the secret. We consider a multipartite setting, with each participant holding a share of the secret. We show that if there exists at least one honest participant, no group of dishonest participants can recover any information about the shared secret, independent of their deviations from the algorithm.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 American Physical Society. Reproduced in accordance with the publisher's self-archiving policy. |
Keywords: | Quantum communication; Quantum channels; Quantum computation; Quantum cryptography |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Science (Sheffield) > Department of Physics and Astronomy (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 02 May 2023 14:56 |
Last Modified: | 02 May 2023 21:20 |
Status: | Published |
Publisher: | American Physical Society (APS) |
Refereed: | Yes |
Identification Number: | 10.1103/physreva.96.052333 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:198727 |