Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01fb494c46v
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorZhandry, Mark
dc.contributor.authorChien, Steven
dc.date.accessioned2020-10-02T21:30:17Z-
dc.date.available2020-10-02T21:30:17Z-
dc.date.created2020-05-04
dc.date.issued2020-10-02-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp01fb494c46v-
dc.description.abstractThreshold secret sharing schemes are procedures in which groups of a sufficient size can work together to recover a shared secret. In this thesis, we analyze quantum threshold schemes, which are threshold secret sharing schemes applied to quantum information. Many of the restrictions on quantum secret sharing schemes arise from the no-cloning theorem. We investigate the potential benefit of implementing quantum threshold schemes using two or more identical copies of a secret quantum state. This idea is motivated by the possibility that the availability of multiple copies of the secret can circumvent the restrictions imposed by the no-cloning theorem. Our approach takes advantage of the multiple copies by using the union of two or more access structures, one for each quantum state, in order to implement secret sharing schemes that would otherwise not be realizable. We find that we are indeed able to implement a wider range of access structures, but we show that we can only realize one new threshold scheme for every new copy of the share, given a fixed number of players.
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleAugmented ((t,n))-threshold Quantum Secret Sharing Schemes
dc.typePrinceton University Senior Theses
pu.date.classyear2020
pu.departmentElectrical Engineering
pu.pdf.coverpageSeniorThesisCoverPage
pu.contributor.authorid961238529
Appears in Collections:Electrical Engineering, 1932-2020

Files in This Item:
File Description SizeFormat 
CHIEN-STEVEN-THESIS.pdf535.13 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.