TY - JOUR
T1 - Quantum verifiable protocol for secure modulo zero-sum randomness
AU - Hayashi, Masahito
AU - Koshiba, Takeshi
N1 - Funding Information:
MH is supported in part by the National Natural Science Foundation of China (Grant No. 62171212) and Guangdong Provincial Key Laboratory (Grant No. 2019B121203002), a JSPS Grant-in-Aids for Scientific Research (A) No. 17H01280 and for Scientific Research (B) No. 16KT0017, and Kayamori Foundation of Information Science Advancement No. K27-XX-467. TK is supported in part by a JSPS Grant-in-Aids for Scientific Research (A) No. 21H04879, and for Challenging Exploratory Research No. 19K22849 and MEXT Quantum Leap Flagship Program (MEXT Q-LEAP) Grant Nos. JPMXS0118067285 and JPMXS0120319794.
Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2022/8
Y1 - 2022/8
N2 - 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.
AB - 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.
KW - Collusion resistance
KW - Modulo summation
KW - Quantum verification
KW - Secure multiparty computation
KW - Self-testing
UR - http://www.scopus.com/inward/record.url?scp=85135949263&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85135949263&partnerID=8YFLogxK
U2 - 10.1007/s11128-022-03639-x
DO - 10.1007/s11128-022-03639-x
M3 - Article
AN - SCOPUS:85135949263
SN - 1570-0755
VL - 21
JO - Quantum Information Processing
JF - Quantum Information Processing
IS - 8
M1 - 291
ER -