You are not logged in.
Openly accessible

Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding

Lai, Hong, Zhang, Jun, Luo, Ming-Xing, Pan, Lei, Pieprzyk, Josef, Xiao, Fuyuan and Orgun, Mehmet A. 2016, Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding, Scientific reports, vol. 6, pp. 1-12, doi: 10.1038/srep31350.

Attached Files
Name Description MIMEType Size Downloads
zhang-hybridthreshold-2016.pdf Published version application/pdf 933.37KB 5

Title Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding
Author(s) Lai, Hong
Zhang, JunORCID iD for Zhang, Jun orcid.org/0000-0002-2189-7801
Luo, Ming-Xing
Pan, LeiORCID iD for Pan, Lei orcid.org/0000-0002-4691-8330
Pieprzyk, Josef
Xiao, Fuyuan
Orgun, Mehmet A.
Journal name Scientific reports
Volume number 6
Article ID 31350
Start page 1
End page 12
Total pages 12
Publisher Nature Publishing Group
Place of publication London, Eng.
Publication date 2016
ISSN 2045-2322
2045-2322
Keyword(s) quantum information
theoretical physics
Science & Technology
Multidisciplinary Sciences
Science & Technology - Other Topics
Summary With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m-bonacci sequences to detect eavesdropping. Meanwhile, we encode m-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.
Language eng
DOI 10.1038/srep31350
Field of Research 080303 Computer System Security
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2016, The Authors
Free to Read? Yes
Use Rights Creative Commons Attribution licence
Persistent URL http://hdl.handle.net/10536/DRO/DU:30085637

Document type: Journal Article
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in TR Web of Science
Scopus Citation Count Cited 1 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 104 Abstract Views, 6 File Downloads  -  Detailed Statistics
Created: Wed, 24 Aug 2016, 10:50:23 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.