EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Quantum Secure Multi-Party Summation with Graph State

Yaohua Lu iD, Gangyi Ding

Entropy · 17.01.2024 · 26 (1) · 80

DOI: 10.3390/e26010080 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 17.01.2024. Verfasst von Yaohua Lu und 1 weiteren Autor:innen. Beteiligte Einrichtung: School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability, and flexibility compared to existing methods. The protocol leverages the structural advantages of graph state and employs random graph state structures and random encryption gate operations to provide stronger security. Additionally, the stabilizer of the graph state is utilized to detect eavesdroppers and channel noise without the need for decoy bits. The protocol allows for the arbitrary addition and deletion of participants, enabling greater flexibility. Experimental verification is conducted to demonstrate the security, effectiveness, and practicality of the proposed protocols. The correctness and security of the protocols are formally proven. The QSMS method based on graph state introduces new opportunities for QSMC. It highlights the potential of leveraging quantum graph state technology to securely and efficiently solve various multi-party computation problems.

Schlagwörter

Stichwörter der Autor:innen

quantum cryptographyquantum graph statequantum secure multi-party summation

Autor:innen und Institutionen

  • School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China.

ORCID-Profile: Yaohua Lu

Zitieren

APA

Lu, Y., & Ding, G. (2024). Quantum Secure Multi-Party Summation with Graph State. Entropy, 26(1), 80. https://doi.org/10.3390/e26010080

Vancouver

Lu Y, Ding G. Quantum Secure Multi-Party Summation with Graph State. Entropy. 2024;26(1):80. doi:10.3390/e26010080

BibTeX
@article{Lu2024,
  author = {Lu, Yaohua and Ding, Gangyi},
  title = {Quantum Secure Multi-Party Summation with Graph State},
  journal = {Entropy},
  year = {2024},
  volume = {26},
  number = {1},
  pages = {80},
  doi = {10.3390/e26010080}
}
Kostenlos starten →