Abstract A dynamic quantum secret sharing protocol with authentication is proposed based on quantum walks. The protocol can share specific secrets and also update the secret information periodically based on the existing quantum walks structure. Participants can be added or removed while keeping the original secret unchanged. This is more flexible in practical applications. Before the secrets are shared, each participant is authenticated to ensure the legitimacy of all participants’ identities. In addition, the protocol uses single photons as quantum resources, avoiding the complex preparation of entangled states, which makes the protocol more advantageous and potential in practical applications. Security analyses show that the protocol is resistant to collusion attack and other common attacks.
Abstract A dynamic quantum secret sharing protocol with authentication is proposed based on quantum walks. The protocol can share specific secrets and also update the secret information periodically based on the existing quantum walks structure. Participants can be added or removed while keeping the original secret unchanged. This is more flexible in practical applications. Before the secrets are shared, each participant is authenticated to ensure the legitimacy of all participants’ identities. In addition, the protocol uses single photons as quantum resources, avoiding the complex preparation of entangled states, which makes the protocol more advantageous and potential in practical applications. Security analyses show that the protocol is resistant to collusion attack and other common attacks.
A verifiable quantum secret sharing protocol using quantum walks on a lattice is proposed in this paper. The protocol utilizes generalized Bell states as the initial quantum resource, integrating the quantum walk evolution operator U with the global shift operator Gab to facilitate joint encrypted transmission among multiple participants. A bidirectional identity authentication mechanism based on hash functions is introduced to ensure the legitimacy of all communication parties, which effectively resists impersonation attacks. Random decoy particles are randomly prepared in either the Zd or Xd basis and inserted into the transmission sequence, enabling real-time eavesdropping detection on the quantum channel. In the secret reconstruction phase, a public verification mechanism is designed to allow participants to verify the correctness of the recovered secret and identify internal dishonest behaviors. Security analysis demonstrates that the protocol achieves information-theoretic security, resisting typical external attacks such as intercept-resend, measure-resend, and entangle-measure attacks, as well as collusion attacks from dishonest internal participants. Compared with existing quantum-walk-based secret sharing schemes, the proposed protocol maintains high qubit efficiency while supporting both identity authentication and public verifiability, thus possessing stronger practicality and security.
Abstract Quantum secret sharing enables participants to share secrets grounded in the principles of quantum mechanics, ensuring the secrets recovery solely through collaborative efforts within an authorized subset of participants. Quantum anonymous secret sharing fulfills the fundamental requirements of quantum secret sharing while also ensuring the anonymity of the secret receivers. In order to address the turnover of personnel in practical scenarios, this paper propose a secure dynamic quantum anonymous secret sharing protocol utilizing Greenberger-Horne-Zeilinger states. In our scheme, on the premise of not reveal the identities of participants, the dynamic update of the participants can be realized, and the shared secret will not be altered. Furthermore, an identity authentication mechanism using single particles is introduced in this protocol, ensuring that only authenticated participants can engage in the sharing process. The proposed protocol is secure and can resist both internal and external attacks. Experimental validation conducted on the IBM quantum computing platform demonstrates the feasibility of our scheme.
Based on the teleportation by quantum walk, a quantum secret sharing scheme with credible authentication is proposed.Using the Hash function and quantum local operation, combined with the two-step quantum walks circuit on the line, the identity authentication and the teleportation of the secret information in distribution phase are realized.Participants collaborate honestly to recover secret information based on particle measurement results, preventing untrusted agents and external attacks from obtaining useful information.Due to the application of quantum walk, the sender does not need to prepare the necessary entangled state in advance, simply encodes the information to be sent in the coin state, and applies the conditional shift operator between the coin space and the position space to produce the entangled state necessary for quantum teleportation.Security analysis shows that the protocol can effectively resist intercept/resend attacks, entanglement attacks, participant attacks, and impersonation attacks.In addition, the quantum walk circuit used has been implemented in many different physical systems and experiments, so this quantum secret sharing scheme may be achievable in the future.
Abstract Quantum secret sharing plays a key role as a foundational method for disseminating a secret to all participants in quantum cryptography. Group authentication plays a significant role in safeguarding information, as it confirms the identity of communication parties. This paper presents a d−level (t,m) threshold quantum secret-sharing scheme combined with group authentication. Group members can simultaneously authenticate their identities through group authentication. Leveraging the Lagrange interpolation polynomial, the group authentication method disperses multiple secret shares to group members and later allows joint verification of some or all members. According to our analysis, the complexities of our group authentication scheme are much lower than those found in widely recognized existing group authentication methods. This algorithm allows each participant to keep their secret shares secure and undisclosed. By avoiding transmission of these shares, external eavesdroppers are unable to obtain any secret information. This protocol offers security, efficiency, and practicality. Security analysis reveals its ability to resist intercept-resend attacks, entangle-measure attacks, collusion attacks, and forgery attacks. The proposed scheme ensures both confidentiality and integrity.
Secret sharing is a cryptographic primitive which plays a central role in various tasks including secure multi-party computation and key management. Quantum schemes for secret sharing commonly rely on multi-particle entangled quantum states, which remains challenging with current experimental technologies. Firstly, in this paper we present a (t,n) quantum secret sharing scheme based on quantum walks on a circle, which only involves two-particle product states as the initial quantum resource. When recovering the secrets, it requires at least t participants sequentially completing their operations on the communicated state, while less than t participants can not acquire any information about the secrets. Secondly, a verification mechanism is designed, which can detect cheats with an asymptotic probability 100%. Finally, we show that the scheme is perfectly correct and is secure against common attacks including collusion attack. In conclusion, the proposed scheme will be useful for quantum communication networks due to its inherent scalability, flexibility and information-theoretical security.
Quantum secret sharing techniques allow two parties or more to securely share a key, while the same number of parties or less can efficiently deduce the secret key. In this paper, we propose an authenticated quantum secret sharing protocol, where a quantum dialogue protocol is adopted to authenticate the identity of the parties. The participants simultaneously authenticate the identity of each other based on parts of a prior shared key. Moreover, the whole prior shared key can be reused for deducing the secret data. Although the proposed scheme does not significantly improve the efficiency performance, it is more secure compared to some existing quantum secret sharing scheme due to the identity authentication process. In addition, the proposed scheme can stand against participant attack, man-in-the-middle attack, impersonation attack, Trojan-horse attack as well as information leaks.