Tight Analysis of a Grover-based Quantum Secret Sharing Scheme

• URL: http://arxiv.org/abs/2511.04399v1
• Date: Thu, 06 Nov 2025 14:26:40 GMT
• Title: Tight Analysis of a Grover-based Quantum Secret Sharing Scheme
• Authors: Santanu Majhi, Debajyoti Bera,
• Abstract summary: We present a complete characterisation of the correctness and security properties of a quantum-search based secret-sharing framework proposed by Hsu (2003).<n>Our characterisation allowed us to improve the original protocol to be more resistant towards eavesdropping. However, we prove that complete security against an eavesdropper is not possible in this framework.
• Score: 0.42970700836450487
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Secret-sharing schemes allow a dealer to split a secret into multiple "shares" and distribute them individually among many parties while mandating certain constraints on its reconstruction. Such protocols are usually executed over a secure communication channel since an eavesdropper, after intercepting all the shares, is expected to be able to reconstruct the secret. Leveraging the unique properties of quantum channels, several quantum protocols have been designed for secret sharing. However, almost all of them detect the presence of an eavesdropper by statistical analysis of the outcome of multiple rounds, or simply require a secure channel of communication. We present a complete characterisation of the correctness and security properties of a quantum-search based secret-sharing framework proposed by Hsu (2003). The scheme was designed to work over public channels without requiring multiple rounds to detect eavesdropping. Our characterisation allowed us to improve the original protocol to be more resistant towards eavesdropping. However, we prove that complete security against an eavesdropper is not possible in this framework.

Related papers

• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• Covert Communication and Key Generation Over Quantum State-Dependent Channels [32.23324743165015]
  We study covert communication and covert secret key generation with positive rates over quantum state-dependent channels.<n>Our results are the first instance of achieving a positive rate for covert secret key generation and the first instance of achieving a positive covert rate over a quantum channel.
  arXiv  Detail & Related papers  (2025-09-19T23:47:55Z)
• Security of a secret sharing protocol on the Qline [0.6554326244334868]
  We present a quantum protocol for distributing additive secret sharing of 0, which we prove to be composably secure within the Abstract Cryptography framework.<n>Our protocol targets the Qline, a recently proposed quantum network architecture designed to simplify and reduce the cost of quantum communication.
  arXiv  Detail & Related papers  (2025-04-28T11:56:45Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Quantum Secret Sharing Enhanced: Utilizing W States for Anonymous and Secure Communication [11.077883755438053]
  Quantum secret sharing (QSS) is the result of merging the principles of quantum mechanics with secret information sharing. We propose a QASS protocol via W states, which can share secrets while ensuring recover-ability, recover-security, and recover-anonymity. Our investigations reveal that W states exhibit good performance in mitigating noise interference, making them apt for practical applications.
  arXiv  Detail & Related papers  (2024-02-04T09:15:02Z)
• Complete security analysis of {quantum key distribution} based on unified model of sequential discrimination strategy [0.0]
  We propose a unified model of sequential discrimination including an eavesdropper. We obtain a non-zero secret key rate between the sender and receiver, which implies that the sender and receiver can share a secret key despite eavesdropping.
  arXiv  Detail & Related papers  (2023-09-26T07:23:34Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Approximate reconstructability of quantum states and noisy quantum secret sharing schemes [19.170626575317907]
  We analyse approximate quantum secret sharing in a formal cryptographic setting. In particular, we show that approximate reconstructability of the quantum secret by these players is possible if and only if the information leakage is small.
  arXiv  Detail & Related papers  (2023-02-06T00:32:01Z)
• One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [24.240914319917053]
  We show that imperfect quantum keys with limited information leakage can be used for digital signatures and authentication without compromising security. This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols.
  arXiv  Detail & Related papers  (2023-01-03T14:54:27Z)
• Key Assistance, Key Agreement, and Layered Secrecy for Bosonic Broadcast Channels [37.90858441567178]
  Secret-sharing building blocks based on quantum broadcast communication are studied. The confidential capacity region of the pure-loss bosonic broadcast channel is determined. We derive an achievable layered-secrecy region for a pure-loss bosonic channel formed by the concatenation of two beam splitters.
  arXiv  Detail & Related papers  (2021-05-09T21:58:17Z)
• Sharing classical secrets with continuous-variable entanglement: Composable security and network coding advantage [0.913755431537592]
  We show that multi-partite entangled resources achieve a genuine advantage over point-to-point protocols for quantum communication. This is the first concrete compelling examples of multi-partite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication.
  arXiv  Detail & Related papers  (2021-04-21T17:37:28Z)
• A Hybrid Quantum Secret Sharing Scheme based on Mutually Unbiased Bases [6.42717893572633]
  We propose a hybrid quantum secret sharing scheme based on mutually unbiased bases and monotone span program. The correctness and security of the scheme are proved and our scheme is secure against the general eavesdropper attacks.
  arXiv  Detail & Related papers  (2020-06-23T06:59:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.