Quantum Shadows: The Dining Information Brokers

• URL: http://arxiv.org/abs/2507.13810v1
• Date: Fri, 18 Jul 2025 10:41:27 GMT
• Title: Quantum Shadows: The Dining Information Brokers
• Authors: Theodore Andronikos, Constantinos Bitsakos, Konstantinos Nikas, Georgios I. Goumas, Nectarios Koziris,
• Abstract summary: The scenario involves $n$ information brokers, all located in distinct geographical regions.<n>The objective is for each broker to share a unique piece of information with all others simultaneously.<n>Unlike previous approaches, this protocol enables a fully parallel, single-step communication exchange among all brokers.
• Score: 2.209328709671456
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This article introduces the innovative Quantum Dining Information Brokers Problem, presenting a novel entanglement-based quantum protocol to address it. The scenario involves $n$ information brokers, all located in distinct geographical regions, engaging in a metaphorical virtual dinner. The objective is for each broker to share a unique piece of information with all others simultaneously. Unlike previous approaches, this protocol enables a fully parallel, single-step communication exchange among all brokers, regardless of their physical locations. A key feature of this protocol is its ability to ensure both the anonymity and privacy of all participants are preserved, meaning no broker can discern the identity of the sender behind any received information. At its core, the Quantum Dining Information Brokers Problem serves as a conceptual framework for achieving anonymous, untraceable, and massively parallel information exchange in a distributed system. The proposed protocol introduces three significant advancements. First, while quantum protocols for one-to-many simultaneous information transmission have been developed, this is, to the best of our knowledge, one of the first quantum protocols to facilitate many-to-many simultaneous information exchange. Second, it guarantees complete anonymity and untraceability for all senders, a critical improvement over sequential applications of one-to-many protocols, which fail to ensure such robust anonymity. Third, leveraging quantum entanglement, the protocol operates in a fully distributed manner, accommodating brokers in diverse spatial locations. This approach marks a substantial advancement in secure, scalable, and anonymous communication, with potential applications in distributed environments where privacy and parallelism are paramount.

Related papers

• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [98.31540557973179]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• Quantum ($t$,$n$) Threshold Multi-Secret Sharing based on Cluster States [1.2932412290302255]
  The first quantum ($t,n$) threshold multi-secret sharing protocol based on Lagrangian and cluster states is proposed.<n>The protocol exploits the security properties of the cluster state to transmit shared information in two parts, quantum and classical.<n>It is proven to be theoretically secure against external and internal attacks by analyzing the protocol.
  arXiv  Detail & Related papers  (2025-05-14T12:14:16Z)
• A distributed and parallel $(k, n)$ QSS scheme with verification capability [0.0]
  This article introduces a novel Quantum Secret Sharing scheme with $( k, n )$ threshold and endowed with verification capability. The primary novelty of the new protocol lies in its ability to operate completely parallelly in a fully distributed setup.
  arXiv  Detail & Related papers  (2024-10-24T11:12:38Z)
• Secured Quantum Identity Authentication Protocol for Quantum Networks [2.3317857568404032]
  This paper proposes a quantum identity authentication protocol that protects quantum networks from malicious entanglements. Unlike the existing protocols, the proposed quantum authentication protocol does not require periodic refreshments of the shared secret keys.
  arXiv  Detail & Related papers  (2023-12-10T05:36:49Z)
• Learning to Cooperate and Communicate Over Imperfect Channels [27.241873614561538]
  We consider a cooperative multi-agent system where the agents act and exchange information in a decentralized manner using a limited and unreliable channel. Our method allows agents to dynamically adapt how much information to share by sending messages of different sizes. We show that our approach outperforms approaches without adaptive capabilities in a novel cooperative digit-prediction environment.
  arXiv  Detail & Related papers  (2023-11-24T12:15:48Z)
• One-to-Many Simultaneous Secure Quantum Information Transmission [0.0]
  This paper presents a new quantum protocol designed to simultaneously transmit information from one source to many recipients. The proposed protocol is completely distributed and is provably information-theoretically secure.
  arXiv  Detail & Related papers  (2023-11-05T00:41:55Z)
• An entanglement-based protocol for simultaneous reciprocal information exchange between 2 players [0.0]
  This work presents and rigorously analyzes a new quantum entanglement-based protocol. The proposed protocol is aptly named entanglement-based reciprocal simultaneous information exchange protocol.
  arXiv  Detail & Related papers  (2023-04-18T14:30:40Z)
• Secure Key from Quantum Discord [22.97866257572447]
  We show how to make use of discord to analyze security in a specific quantum cryptography protocol. Our method is robust against imperfections in qubit sources and qubit measurements as well as basis misalignment due to quantum channels.
  arXiv  Detail & Related papers  (2023-04-12T14:21:49Z)
• A scheme to create and verify scalable entanglement in optical lattice [17.18535438442883]
  We propose an efficient scheme to generate and characterize global entanglement in the optical lattice. With only two-layer quantum circuits, the generation utilizes two-qubit entangling gates based on the superexchange interaction in double wells. Our entanglement generation and verification protocols provide the foundation for the further quantum information processing in optical lattice.
  arXiv  Detail & Related papers  (2022-09-04T04:48:05Z)
• One-shot quantum state redistribution and quantum Markov chains [15.66921140731163]
  We revisit the task of quantum state redistribution in the one-shot setting. We design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains. Our result is the first to operationally connect quantum state redistribution and quantum chains.
  arXiv  Detail & Related papers  (2021-04-18T07:34:22Z)
• Quasi-Equivalence Discovery for Zero-Shot Emergent Communication [63.175848843466845]
  We present a novel problem setting and the Quasi-Equivalence Discovery algorithm that allows for zero-shot coordination (ZSC) We show that these two factors lead to unique optimal ZSC policies in referential games. QED can iteratively discover the symmetries in this setting and converges to the optimal ZSC policy.
  arXiv  Detail & Related papers  (2021-03-14T23:42:37Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)

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.