Quantum verifiable protocol for secure modulo zero-sum randomness

Masahito Hayashi*, Takeshi Koshiba

*この研究の対応する著者

研究成果: Article査読

抄録

We propose a new cryptographic resource, secure modulo zero-sum randomness, as a resource to implement a task of secure modulo summation, and its quantum protocol. Secure modulo summation is the calculation of modulo summation Y1+ ⋯ + Ym when m players have their individual variables Y1, … , Ym with keeping the secrecy of the individual variables. Secure modulo zero-sum randomness is a set of m variables X1, … , Xm held by m players that satisfy the zero sum condition X1+ ⋯ + Xm= 0 with a certain security condition. This paper explains the relation between these two concepts and proposes a quantum verifiable protocol for secure modulo summation. The advantage for quantum protocol is the verifiability based on self-testing, which does not need to trust measurement devices and can be realized by using a statistical concept, significance level, while any classical method needs to trust several components of the protocol. Then, we propose various cryptographic applications for secure modulo zero-sum randomness. We also compare our quantum verifiable protocol with the conventional method for secure modulo summation.

本文言語English
論文番号291
ジャーナルQuantum Information Processing
21
8
DOI
出版ステータスPublished - 2022 8月

ASJC Scopus subject areas

  • 電子材料、光学材料、および磁性材料
  • 統計物理学および非線形物理学
  • 理論的コンピュータサイエンス
  • 信号処理
  • モデリングとシミュレーション
  • 電子工学および電気工学

フィンガープリント

「Quantum verifiable protocol for secure modulo zero-sum randomness」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル