Quantum secret aggregation utilizing a network of agents

• URL: http://arxiv.org/abs/2211.15758v1
• Date: Mon, 28 Nov 2022 20:27:05 GMT
• Title: Quantum secret aggregation utilizing a network of agents
• Authors: Michael Ampatzis and Theodore Andronikos
• Abstract summary: We consider a network of spies, all distributed in different locations in space, and assuming that each spy possesses a small, but incomplete by itself part of a big secret. Is it possible to securely transmit all these partial secrets to the spymaster, so that they can be combined together in order to reveal the big secret? We propose a protocol, in the form of a quantum game, with Alice taking over the role of the spymaster, that addresses this problem in complete generality.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work we consider the following problem: given a network of spies, all distributed in different locations in space, and assuming that each spy possesses a small, but incomplete by itself part of a big secret, is it possible to securely transmit all these partial secrets to the spymaster, so that they can be combined together in order to reveal the big secret? We refer to it as the Quantum Secret Aggregation problem, and we propose a protocol, in the form of a quantum game, with Alice taking over the role of the spymaster, that addresses this problem in complete generality. Our protocol relies on the use of maximally entangled GHZ tuples, which are symmetrically distributed among Alice and all her spies. It is the power of entanglement that makes possible the secure transmission of the small partial secrets from the agents to the spymaster. As an additional bonus, entanglement guarantees the security of the protocol, by making it statistically improbable for the notorious eavesdropper Eve to steal the big secret.

Related papers

• Optimal Computational Secret Sharing [51.599517747577266]
  In $(t, n)$-threshold secret sharing, a secret $S$ is distributed among $n$ participants. We present a construction achieving a share size of $tfrac|S|t + |K|t$.
  arXiv  Detail & Related papers  (2025-02-04T23:37:16Z)
• Security and Fairness in Multi-Party Quantum Secret Sharing Protocol [0.0]
  Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. We introduce a new concept of QSS which leans on a generic distributed quantum-network, based on a threshold scheme. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks.
  arXiv  Detail & Related papers  (2024-12-16T11:18:52Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs. This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Quantum cloning transformation unlocks the potential of W class of states in a secret sharing protocol [0.0]
  We introduce a quantum secret sharing protocol exploiting a three-qubit W class of state shared between three parties. We find that the protocol is probabilistic and have calculated the probability of success of the protocol. Even a less entangled W class of state can also play a vital role in the proposed secret-sharing scheme.
  arXiv  Detail & Related papers  (2024-08-13T08:27:58Z)
• Mask-coding-assisted continuous-variable quantum direct communication with orbital angular momentum multiplexing [31.687177215854717]
  Quantum secure direct communication (QSDC) is a approach of communication to transmit secret messages base on quantum mechanics. We report a continuous-variable QSDC scheme based on mask-coding and orbital angular momentum.
  arXiv  Detail & Related papers  (2024-06-17T08:36:57Z)
• Unclonable Secret Sharing [18.564937506648622]
  Unclonable cryptography utilizes the principles of quantum mechanics to addresses cryptographic tasks that are impossible classically. We introduce a novel unclonable primitive in the context of secret sharing, called unclonable secret sharing (USS)
  arXiv  Detail & Related papers  (2024-06-16T16:50:15Z)
• 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)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• 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)
• Hiding Images in Deep Probabilistic Models [58.23127414572098]
  We describe a different computational framework to hide images in deep probabilistic models. Specifically, we use a DNN to model the probability density of cover images, and hide a secret image in one particular location of the learned distribution. We demonstrate the feasibility of our SinGAN approach in terms of extraction accuracy and model security.
  arXiv  Detail & Related papers  (2022-10-05T13:33:25Z)
• A symmetric extensible protocol for quantum secret sharing [0.0]
  This paper introduces the Symmetric Quantum Secret Sharing protocol. It is an entanglement based protocol that relies on the use of maximally entangled GHZs. It offers uncompromising security, making virtually impossible for a malicious eavesdropper or a rogue double agent to disrupt its successful execution.
  arXiv  Detail & Related papers  (2022-04-28T10:27:44Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)
• Universal Communication Efficient Quantum Threshold Secret Sharing Schemes [3.8073142980733]
  We propose a more general class of $((k,n))$ quantum secret sharing schemes with low communication complexity. Our schemes are universal in the sense that the combiner can contact any number of parties to recover the secret with communication efficiency.
  arXiv  Detail & Related papers  (2020-02-21T11:14:40Z)

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.