License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2023.4
URN: urn:nbn:de:0030-drops-183144
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18314/
Çakan, Alper ;
Goyal, Vipul ;
Liu-Zhang, Chen-Da ;
Ribeiro, João
Computational Quantum Secret Sharing
Abstract
Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties in such a way that certain authorized subsets can reconstruct the secret, while unauthorized subsets obtain no information about it. Previous works on QSS for general access structures focused solely on the existence of perfectly secure schemes, and the share size of the known schemes is necessarily exponential even in cases where the access structure is computed by polynomial size monotone circuits. This stands in stark contrast to the classical setting, where polynomial-time computationally-secure secret sharing schemes have been long known for all access structures computed by polynomial-size monotone circuits under standard hardness assumptions, and one can even obtain shares which are much shorter than the secret (which is impossible with perfect security).
While QSS was introduced over twenty years ago, previous works only considered information-theoretic privacy. In this work, we initiate the study of computationally-secure QSS and show that computational assumptions help significantly in building QSS schemes, just as in the classical case. We present a simple compiler and use it to obtain a large variety results: We construct polynomial-time computationally-secure QSS schemes under standard hardness assumptions for a rich class of access structures. This includes many access structures for which previous results in QSS necessarily required exponential share size. In fact, we can go even further: We construct QSS schemes for which the size of the quantum shares is significantly smaller than the size of the secret. As in the classical setting, this is impossible with perfect security.
We also apply our compiler to obtain results beyond computational QSS. In the information-theoretic setting, we improve the share size of perfect QSS schemes for a large class of n-party access structures to 1.5^{n+o(n)}, improving upon best known schemes and matching the best known result for general access structures in the classical setting. Finally, among other things, we study the class of access structures which can be efficiently implemented when the quantum secret sharing scheme has access to a given number of copies of the secret, including all such functions in ? and NP.
BibTeX - Entry
@InProceedings{cakan_et_al:LIPIcs.TQC.2023.4,
author = {\c{C}akan, Alper and Goyal, Vipul and Liu-Zhang, Chen-Da and Ribeiro, Jo\~{a}o},
title = {{Computational Quantum Secret Sharing}},
booktitle = {18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023)},
pages = {4:1--4:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-283-9},
ISSN = {1868-8969},
year = {2023},
volume = {266},
editor = {Fawzi, Omar and Walter, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18314},
URN = {urn:nbn:de:0030-drops-183144},
doi = {10.4230/LIPIcs.TQC.2023.4},
annote = {Keywords: Quantum secret sharing, quantum cryptography}
}
|
Keywords: |
|
Quantum secret sharing, quantum cryptography |
|
Collection: |
|
18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
18.07.2023 |
