A GHZ-Based Protocol for the Dining Information Brokers Problem
Theodore Andronikos (),
Constantinos Bitsakos,
Konstantinos Nikas,
Georgios I. Goumas and
Nectarios Koziris
Additional contact information
Theodore Andronikos: Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece
Constantinos Bitsakos: Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece
Konstantinos Nikas: Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece
Georgios I. Goumas: Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece
Nectarios Koziris: Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece
Future Internet, 2025, vol. 17, issue 9, 1-38
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 the others simultaneously. Unlike previous approaches, this protocol enables a fully parallel, single-step communication exchange among all the brokers, regardless of their physical locations. A key feature of this protocol is its ability to ensure that both the anonymity and privacy of all the participants are preserved, meaning that no broker can discern the identity of the sender of 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.
Keywords: quantum cryptography; quantum entanglement; GHZ states; the Dining Cryptographers Problem; the Dining Information Brokers Problem; quantum protocols; quantum games (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/1999-5903/17/9/408/pdf (application/pdf)
https://www.mdpi.com/1999-5903/17/9/408/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:17:y:2025:i:9:p:408-:d:1743806
Access Statistics for this article
Future Internet is currently edited by Ms. Grace You
More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().