{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:51:06Z","timestamp":1760147466986,"version":"build-2065373602"},"reference-count":59,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T00:00:00Z","timestamp":1675382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Suppose that the renowned spymaster Alice controls a network of spies who all happen to be deployed in different geographical locations. Let us further assume that all spies have managed to get their hands on a small, albeit incomplete by itself, secret, which actually is just a part of a bigger secret. In this work, we consider the following problem: given the above situation, is it possible for the spies to securely transmit all these partial secrets to the spymaster so that they can be combined together in order to reveal the big secret to Alice? We call this problem, which, to the best of our knowledge, is a novel one for the relevant literature, the quantum secret aggregation problem. We propose a protocol, in the form of a quantum game, that addresses this problem in complete generality. Our protocol relies on the use of maximally entangled GHZ tuples, shared 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.<\/jats:p>","DOI":"10.3390\/cryptography7010005","type":"journal-article","created":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T05:09:20Z","timestamp":1675400960000},"page":"5","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Quantum Secret Aggregation Utilizing a Network of Agents"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1570-6722","authenticated-orcid":false,"given":"Michael","family":"Ampatzis","sequence":"first","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3741-1271","authenticated-orcid":false,"given":"Theodore","family":"Andronikos","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2023,2,3]]},"reference":[{"key":"ref_1","unstructured":"Shor, P. (1994, January 20\u201322). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the Proceedings 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Grover, L. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_3","unstructured":"Chow, J., Dial, O., and Gambetta, J. (2022, April 03). IBM Quantum Breaks the 100-Qubit Processor Barrier. Available online: https:\/\/research.ibm.com\/blog\/127-qubit-quantum-processor-eagle."},{"key":"ref_4","unstructured":"Newsroom, I. (2022, November 18). IBM Unveils 400 Qubit-Plus Quantum Processor. Available online: https:\/\/newsroom.ibm.com\/2022-11-09-IBM-Unveils-400-Qubit-Plus-Quantum-Processor-and-Next-Generation-IBM-Quantum-System-Two."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.comcom.2021.05.019","article-title":"Information security in the post quantum era for 5G and beyond networks: Threats to existing cryptography, and post-quantum cryptography","volume":"176","author":"Chamola","year":"2021","journal-title":"Comput. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Chen, L., Jordan, S., Liu, Y.K., Moody, D., Peralta, R., Perlner, R., and Smith-Tone, D. (2022, April 03). Report on Post-Quantum Cryptography, Available online: https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2016\/NIST.IR.8105.pdf.","DOI":"10.6028\/NIST.IR.8105"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Alagic, G., Alperin-Sheriff, J., Apon, D., Cooper, D., Dang, Q., Liu, Y.K., Miller, C., Moody, D., Peralta, R., and Perlner, R. (2022, April 03). Status Report on the First Round of the NIST Post-Quantum Cryptography Standardization Process, Available online: https:\/\/tsapps.nist.gov\/publication\/get_pdf.cfm?pub_id=927303.","DOI":"10.6028\/NIST.IR.8413"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Alagic, G., Alperin-Sheriff, J., Apon, D., Cooper, D., Dang, Q., Kelsey, J., Liu, Y.K., Miller, C., Moody, D., and Peralta, R. (2020). Status Report on the Second Round of the NIST Post-Quantum Cryptography Standardization Process, US Department of Commerce, NIST.","DOI":"10.6028\/NIST.IR.8240"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Miller, C., Moody, D., and Peralta, R. (2022). Status Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process, National Institute of Standards and Technology.","DOI":"10.6028\/NIST.IR.8413"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1103\/PhysRevLett.67.661","article-title":"Quantum cryptography based on Bell\u2019s theorem","volume":"67","author":"Ekert","year":"1991","journal-title":"Phys. Rev. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1103\/PhysRevLett.68.557","article-title":"Quantum cryptography without Bell\u2019s theorem","volume":"68","author":"Bennett","year":"1992","journal-title":"Phys. Rev. Lett."},{"key":"ref_12","unstructured":"Gisin, N., Ribordy, G., Zbinden, H., Stucki, D., Brunner, N., and Scarani, V. (2004). Towards practical and fast quantum cryptography. arXiv."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"037902","DOI":"10.1103\/PhysRevLett.89.037902","article-title":"Differential phase shift quantum key distribution","volume":"89","author":"Inoue","year":"2002","journal-title":"Phys. Rev. Lett."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"180502","DOI":"10.1103\/PhysRevLett.114.180502","article-title":"Experimental passive round-robin differential phase-shift quantum key distribution","volume":"114","author":"Guan","year":"2015","journal-title":"Phys. Rev. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"012344","DOI":"10.1103\/PhysRevA.73.012344","article-title":"Security of differential-phase-shift quantum key distribution against individual attacks","volume":"73","author":"Waks","year":"2006","journal-title":"Phys. Rev. A"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Ampatzis, M., and Andronikos, T. (2021). QKD Based on Symmetric Entangled Bernstein-Vazirani. Entropy, 23.","DOI":"10.3390\/e23070870"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Ampatzis, M., and Andronikos, T. (2022). A Symmetric Extensible Protocol for Quantum Secret Sharing. Symmetry, 14.","DOI":"10.3390\/sym14081692"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s00778-017-0470-9","article-title":"Secret sharing for cloud data security: A survey","volume":"26","author":"Attasena","year":"2017","journal-title":"VLDB J."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Ermakova, T., and Fabian, B. (2013, January 15\u201318). Secret sharing for health data in multi-provider clouds. Proceedings of the 2013 IEEE 15th Conference on Business Informatics, Vienna, Austria.","DOI":"10.1109\/CBI.2013.22"},{"key":"ref_20","first-page":"102686","article-title":"Blockchain-empowered cloud architecture based on secret sharing for smart city","volume":"57","author":"Cha","year":"2021","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1829","DOI":"10.1103\/PhysRevA.59.1829","article-title":"Quantum secret sharing","volume":"59","author":"Hillery","year":"1999","journal-title":"Phys. Rev. A"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1103\/PhysRevLett.83.648","article-title":"How to share a quantum secret","volume":"83","author":"Cleve","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1103\/PhysRevA.59.162","article-title":"Quantum entanglement for secret sharing and secret splitting","volume":"59","author":"Karlsson","year":"1999","journal-title":"Phys. Rev. A"},{"key":"ref_24","unstructured":"Smith, A.D. (2000). Quantum secret sharing for general access structures. arXiv."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"042311","DOI":"10.1103\/PhysRevA.61.042311","article-title":"Theory of quantum secret sharing","volume":"61","author":"Gottesman","year":"2000","journal-title":"Phys. Rev. A"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"6659","DOI":"10.1109\/TIT.2012.2205895","article-title":"Reducing the quantum communication cost of quantum secret sharing","volume":"58","author":"Fortescue","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/JSTQE.2020.2975600","article-title":"Hierarchical quantum secret sharing based on special high-dimensional entangled state","volume":"26","author":"Qin","year":"2020","journal-title":"IEEE J. Sel. Top. Quantum Electron."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3164","DOI":"10.1109\/TIT.2021.3139839","article-title":"Theory of communication efficient quantum secret sharing","volume":"68","author":"Senthoor","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"090501","DOI":"10.1103\/PhysRevLett.114.090501","article-title":"Long-distance measurement-device-independent multiparty quantum communication","volume":"114","author":"Fu","year":"2015","journal-title":"Phys. Rev. Lett."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"022301","DOI":"10.1103\/PhysRevA.101.022301","article-title":"Passive continuous-variable quantum secret sharing using a thermal source","volume":"101","author":"Wu","year":"2020","journal-title":"Phys. Rev. A"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"022339","DOI":"10.1103\/PhysRevA.100.022339","article-title":"Quantum secret sharing using weak coherent states","volume":"100","author":"Grice","year":"2019","journal-title":"Phys. Rev. A"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"32244","DOI":"10.1364\/OE.440365","article-title":"Secure quantum secret sharing without signal disturbance monitoring","volume":"29","author":"Gu","year":"2021","journal-title":"Opt. Express"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"062315","DOI":"10.1103\/PhysRevA.82.062315","article-title":"Quantum secret sharing with qudit graph states","volume":"82","author":"Keet","year":"2010","journal-title":"Phys. Rev. A"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"052335","DOI":"10.1103\/PhysRevA.86.052335","article-title":"Absolute maximal entanglement and quantum secret sharing","volume":"86","author":"Helwig","year":"2012","journal-title":"Phys. Rev. A"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/s10773-017-3574-5","article-title":"Quantum-secret-sharing scheme based on local distinguishability of orthogonal seven-qudit entangled states","volume":"57","author":"Liu","year":"2018","journal-title":"Int. J. Theor. Phys."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"3876","DOI":"10.1007\/s10773-020-04639-2","article-title":"Quantum secret sharing protocol using maximally entangled multi-qudit states","volume":"59","author":"Mansour","year":"2020","journal-title":"Int. J. Theor. Phys."},{"key":"ref_37","unstructured":"Bennett, C.H., and Brassard, G. (1984, January 10\u201312). Quantum Cryptography: Public Key Distribution and Coin Tossing. Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1103\/PhysRevLett.82.1052","article-title":"Quantum strategies","volume":"82","author":"Meyer","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"3077","DOI":"10.1103\/PhysRevLett.83.3077","article-title":"Quantum games and quantum strategies","volume":"83","author":"Eisert","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Andronikos, T., Sirokofskich, A., Kastampolidou, K., Varvouzou, M., Giannakis, K., and Singh, A. (2018). Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game. Mathematics, 6.","DOI":"10.3390\/math6020020"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Andronikos, T., and Sirokofskich, A. (2021). The Connection between the PQ Penny Flip Game and the Dihedral Groups. Mathematics, 9.","DOI":"10.3390\/math9101115"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Andronikos, T. (2022). Conditions that enable a player to surely win in sequential quantum games. Quantum Inf. Process., 21.","DOI":"10.1007\/s11128-022-03604-8"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Giannakis, K., Theocharopoulou, G., Papalitsas, C., Fanarioti, S., and Andronikos, T. (2019). Quantum Conditional Strategies and Automata for Prisoners\u2019 Dilemmata under the EWL Scheme. Appl. Sci., 9.","DOI":"10.20944\/preprints201905.0366.v1"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"586","DOI":"10.3390\/computation3040586","article-title":"Dominant Strategies of Quantum Games on Quantum Periodic Automata","volume":"3","author":"Giannakis","year":"2015","journal-title":"Computation"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Andronikos, T., and Stefanidakis, M. (2022). A Two-Party Quantum Parliament. Algorithms, 15.","DOI":"10.3390\/a15020062"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1900015","DOI":"10.1002\/qute.201900015","article-title":"Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer","volume":"2","author":"Cruz","year":"2019","journal-title":"Adv. Quantum Technol."},{"key":"ref_47","unstructured":"IBM (2022, November 18). IBM Quantum Composer. Available online: https:\/\/quantum-computing.ibm.com\/composer."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1109\/JSTQE.2003.820918","article-title":"Long-distance quantum communication with entangled photons using satellites","volume":"9","author":"Aspelmeyer","year":"2003","journal-title":"IEEE J. Sel. Top. Quantum Electron."},{"key":"ref_49","unstructured":"Qiskit (2022, November 18). Qiskit Open-Source Quantum Development. Available online: https:\/\/qiskit.org."},{"key":"ref_50","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Mermin, N. (2007). Quantum Computer Science: An Introduction, Cambridge University Press.","DOI":"10.1017\/CBO9780511813870"},{"key":"ref_52","unstructured":"Qasm (2022, April 03). The Qasm Simulator. Available online: https:\/\/qiskit.org\/documentation\/stubs\/qiskit.providers.aer.QasmSimulator.html."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1038\/299802a0","article-title":"A single quantum cannot be cloned","volume":"299","author":"Wootters","year":"1982","journal-title":"Nature"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"052306","DOI":"10.1103\/PhysRevA.61.052306","article-title":"Distributed entanglement","volume":"61","author":"Coffman","year":"2000","journal-title":"Phys. Rev. A"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1103\/RevModPhys.86.419","article-title":"Bell nonlocality","volume":"86","author":"Brunner","year":"2014","journal-title":"Rev. Mod. Phys."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1038\/ncomms1416","article-title":"No extension of quantum theory can have improved predictive power","volume":"2","author":"Colbeck","year":"2011","journal-title":"Nat. Commun."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"1863","DOI":"10.1103\/PhysRevA.51.1863","article-title":"Quantum cryptography with coherent states","volume":"51","author":"Huttner","year":"1995","journal-title":"Phys. Rev. A"},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"052304","DOI":"10.1103\/PhysRevA.61.052304","article-title":"Security against individual attacks for realistic quantum key distribution","volume":"61","year":"2000","journal-title":"Phys. Rev. A"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1103\/PhysRevLett.85.1330","article-title":"Limitations on practical quantum cryptography","volume":"85","author":"Brassard","year":"2000","journal-title":"Phys. Rev. Lett."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/1\/5\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:23:17Z","timestamp":1760120597000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/1\/5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,3]]},"references-count":59,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["cryptography7010005"],"URL":"https:\/\/doi.org\/10.3390\/cryptography7010005","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2023,2,3]]}}}