The fundamental concepts, safety guarantees, efficiency, and applicability to real-world cryptographic applications of both classical and quantum secret sharing techniques are carefully discussed in this work. Shamir’s and Blakley’s schemes are examples of CSS schemes that for long have provided information-theoretic security for sharing secrets among multiple parties such that only authorized subsets are able to retrieve the secret. However, in the post-quantum era, these systems inherently have a vulnerability to quantum computational attacks due to the fact that they rely exclusively on classical communication. This paper assesses trade-offs between classical efficiency and quantum-level security by closely examining their methodologies, security models, and resource requirements. Furthermore, it discusses practical issues, such as decoherence, quantum memory constraints, and channel authentication, that present significant challenges in the implementation of QSS. By making a comparison between these two paradigms, we identify the contexts in which each approach is particularly suitable, and thus point to possible hybrid frameworks combining the robustness of classical cryptography with quantum security. These comparisons provide new insights for designing next-generation cryptographic protocols in emerging quantum technologies.
The fundamental concepts, safety guarantees, efficiency, and applicability to real-world cryptographic applications of both classical and quantum secret sharing techniques are carefully discussed in this work. Shamir’s and Blakley’s schemes are examples of CSS schemes that for long have provided information-theoretic security for sharing secrets among multiple parties such that only authorized subsets are able to retrieve the secret. However, in the post-quantum era, these systems inherently have a vulnerability to quantum computational attacks due to the fact that they rely exclusively on classical communication. This paper assesses trade-offs between classical efficiency and quantum-level security by closely examining their methodologies, security models, and resource requirements. Furthermore, it discusses practical issues, such as decoherence, quantum memory constraints, and channel authentication, that present significant challenges in the implementation of QSS. By making a comparison between these two paradigms, we identify the contexts in which each approach is particularly suitable, and thus point to possible hybrid frameworks combining the robustness of classical cryptography with quantum security. These comparisons provide new insights for designing next-generation cryptographic protocols in emerging quantum technologies.
Modern approaches to secret sharing have been examined, encompassing both classical and post-quantum cryptographic schemes. The study explores methods for distributing secret information among multiple participants using various mathematical primitives, such as Lagrange and Newton polynomials, the Chinese remainder theorem, error-correcting codes, lattice theory, elliptic curve isogenies, multivariate equations, and hash functions. A comparative analysis of different schemes is provided in terms of their resistance to quantum attacks, efficiency, and compliance with Shamir’s criteria. Special attention is given to assessing the schemes resilience against attacks using quantum computers, which is particularly relevant given the advancement of quantum technologies. The advantages and disadvantages of each scheme are discussed, including their computational complexity, flexibility, and adaptability to various conditions. It is shown that classical schemes, such as those by Shamir and Newton, remain efficient and easy to implement but are vulnerable to quantum attacks. Meanwhile, post-quantum schemes based on lattice theory demonstrate a high level of security but require more complex computations.
Quantum secret sharing (QSS), as a quantum extension of classical secret sharing, uses the basic principles of quantum mechanics to share information safely among multiple parties, providing a new paradigm for information security. As a key foundation for secure multiparty quantum communication and distributed quantum computing, QSS has attracted considerable attention since its emergence. Currently, research in this field includes both classical and quantum scenarios, and continuous progress has been made in both theoretical and experimental aspects. This paper first reviews the current development of QSS for classical information. In this regard, significant and parallel progress has been made in both discrete-variable QSS and continuous-variable QSS. The QSS protocols for sharing classical information, from entangled states to single photons and then to coherent light, have been continuously optimized to better utilize available resources and achieve more efficient implementation under current technological conditions. Meanwhile, round-robin, measurement-device-independent, and other protocols have been steadily improving the security of QSS. Next, one will focus on QSS scheme for quantum secrets, which begins with the symmetry of access structures and introduces basic (k, n) threshold protocols, dynamic schemes that support adaptive agent groups, and symmetric quantum information splitting through entanglement. It further introduces hierarchical quantum secret sharing schemes for asymmetric splitting of quantum information. Considering practical laboratory conditions of quantum states as resources, an overall discussion is conducted on quantum secret sharing with graph states. Afterwards, the design of a continuous-variable scheme for quantum secret sharing is outlined, and entanglement state sharing and quantum teleportation between multiple senders and receivers are introduced. Finally, this review discusses and outlines the future development directions of QSS, thereby inspiring readers to further study and explore the relevant subjects.
Classical secret sharing proposed by Shamir used classical computational power in classical cryptography to achieve secret key sharing, but with the advent of quantum systems, computational power can be overruled. To ensure a secure secret sharing scheme independent of computational power, a scheme independent of computational complexity is needed to achieve security. This paper will provide a protocol dependent on inherent secure nature of quantum cryptography (quantum no cloning theorem and quantum measurement rule). A secure multiparty quantum secret sharing scheme has been proposed to ensure that no one can eavesdrop or extract any share of the secret message via inherent security provided by quantum entanglement swapping and quantum teleportation. Entanglement swapping is a process that allows two non-interacting quantum systems to be entangled. Whereas, Quantum teleportation allows a party to send a qubit to another entangled party without sending the qubit over the channel. Moreover, in order to ensure security against possible active attacks, sender himself will generate and distribute EPR pairs to be used in the scheme. Result will be a secure multiparty QSS scheme which will be secure against internal and external eavesdropping, masquerading and brute-force attacks.
The rapid advancement of quantum computing poses a significant threat to classical cryptographic systems that rely on the computational hardness of mathematical problems such as integer factorization and discrete logarithm problems. In this context, quantum cryptography has emerged as a promising paradigm for secure communication based on the fundamental principles of quantum mechanics rather than on computational assumptions. This paper presents a comprehensive review of quantum cryptography, with a particular focus on Quantum Key Distribution (QKD), the most mature application. The study discusses the theoretical foundations of quantum security, including superposition, entanglement, and the No-cloning theorem, which collectively enable eavesdropping detection and guarantee information-theoretic security. Furthermore, the review examines major QKD protocols, such as BB84 and E91, as well as their advanced variants designed to address practical vulnerabilities and enhance performance. Recent progress in real-world implementations, including fiber-optic networks, free-space communication, and satellite-based systems such as the Micius satellite, is also analyzed. In addition, the paper highlights critical challenges related to scalability, hardware limitations, and security loopholes arising from imperfect devices. Finally, emerging research directions, including hybrid cryptographic frameworks that integrate quantum and post-quantum approaches, are discussed to provide insights into the future of secure communication. This review aims to provide a structured, up-to-date understanding of quantum cryptography, bridging the gap between theoretical developments and practical implementations, and emphasizing its crucial role in shaping next-generation cybersecurity systems.
This paper gives a comprehensive review of quantum cryptographic advances in the context of the most critical vulnerabilities that classical encryption schemes have in the era of quantum computing. We compare the vulnerabilities of existing solutions like RSA and ECC to quantum attacks and examine new quantum-resistant solutions like lattice cryptography and Quantum Key Distribution (QKD) schemes. Comparing BB84, E91, and post-quantum solutions, this survey identifies leading challenges in real-world deployment, i.e., photon loss and quantum repeater constraints. Our paper contributes a migration framework towards quantum-secure systems, emphasising hybrid classical-quantum solutions. This work is a research guide and policymaker's companion to quantum-proof cryptographic infrastructure against quantum attacks. Future implementations will incorporate photon polarisation simulations and quantum channel modelling for information-theoretic security.
Quantum computing presents both transformative potential and significant risks to modern information security by threatening widely used cryptographic algorithms. This paper provides a comprehensive overview of Quantum Resistant Cybersecurity (QRCS), focusing on two principal approaches: quantum cryptography, which exploits core quantum information security principles such as quantum key distribution (QKD), and post-quantum cryptography (PQC), employing contemporary primitives designed to withstand quantum attacks. We examine the core concepts, challenges, and practical trade-offs associated with both paradigms, including protocol-level adaptations, standardization efforts, and integration with existing communication infrastructures. A hybrid QRCS framework is introduced that illustrates how quantum and classical channels can be secure to enhance overall communication system security. The core components of the nexus of the proposed framework are quantum encryption key,KEq, and leveraging the benefits of secret sharing of QKD. The paper presents a communication system including various components with an interaction of classical and quantum worlds. Furthermore, it also discusses organizational strategies for migration, risk assessment, and governance in preparation for the quantum era. Finally, key future directions are outlined, emphasizing the need for continued research, robust standardization, and interdisciplinary collaboration to enable timely and resilient deployment of quantum-safe systems.