Quantum verifiable protocol for secure modulo zero-sum randomness

Hayashi, Masahito1,2,3,4; Koshiba, Takeshi5,6

2022-08-13

10.1007/s11128-022-03639-x

Quantum Information Processing   影响因子和分区

1570-0755

1573-1332

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 Y-1 +( )... + Y-m when m players have their individual variables Y-1 ,..., Y-m with keeping the secrecy of the individual variables. Secure modulo zero-sum randomness is a set of m variables X-1, ..., X-m held by m players that satisfy the zero sum condition X-1 + ... + X-m = 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.

Secure multiparty computation Modulo summation Quantum verification Collusion resistance Self-testing

SCI ; EI

英语

第一 ; 通讯

National Natural Science Foundation of China[62171212] ; Guangdong Provincial Key Laboratory[2019B121203002] ; JSPS["21H04879","19K22849","17H01280","16KT0017"] ; Kayamori Foundation of Information Science Advancement[K27-XX-467] ; MEXT Quantum Leap Flagship Program (MEXT Q-LEAP)["JPMXS0118067285","JPMXS0120319794"]

Physics

Quantum Science & Technology ; Physics, Multidisciplinary ; Physics, Mathematical

WOS:000840329700024

SPRINGER

20223412597261

Quantum cryptography

Probability Theory:922.1

Web of Science

1.Southern Univ Sci & Technol, Shenzhen Inst Quantum Sci & Engn, Shenzhen 518055, Guangdong, Peoples R China
2.Int Quantum Acad SIQA, Shenzhen 518048, Guangdong, Peoples R China
3.Southern Univ Sci & Technol, Guangdong Prov Key Lab Quantum Sci & Engn, Shenzhen 518055, Guangdong, Peoples R China
4.Nagoya Univ, Grad Sch Math, Chikusa Ku, Nagoya, Aichi 4648602, Japan
5.Waseda Univ, Fac Educ & Integrated Arts & Sci, Tokyo 1698050, Japan
6.Keio Univ, Quantum Comp Ctr, Yokohama, Kanagawa 2238522, Japan

Hayashi, Masahito,Koshiba, Takeshi. Quantum verifiable protocol for secure modulo zero-sum randomness[J]. Quantum Information Processing,2022,21(8).

Hayashi, Masahito,&Koshiba, Takeshi.(2022).Quantum verifiable protocol for secure modulo zero-sum randomness.Quantum Information Processing,21(8).

Hayashi, Masahito,et al."Quantum verifiable protocol for secure modulo zero-sum randomness".Quantum Information Processing 21.8(2022).