Abstract
Recently, Yuan et al. summarized some previous analysis of quantum secret sharing task and designed a multiparty quantum secret sharing protocol based on the continuous variable operations (CVO) with the ideas of dense coding and ping-pong technique (YMQSS). However, our research shows that the YMQSS protocol is unable to complete the quantum secret sharing task securely if the particular participant, Bob0, is dishonest. In order to show that, we describe the following two attack strategies: one is that Bob0 can get the accurate shared secrets himself and leave the other sharers get his forged ones; the other one is that Bob0 can conspire with another sharer Bob i (i≠0) to get Alice’s secrets without anyone’s help. Finally, our discussions and conclusions are proposed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
