Secure Modulo Sum via Multiple Access Channel

Hayashi, Masahito

doi:10.48550/arxiv.1812.10862

Cited by 1 publication

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, secure modulo zero-sum randomness among m players can be generated with asymptotically negligible error when the multiple access channel satisfies a certain condition and they can use the multiple access channel n times. The detail construction will be given in [36]. Also, with asymptotically negligible error, it can be extracted from the n-fold independent and identical distribution of a certain joint distribution of m random variables Z 1 , .…”

Section: Asymptotically Approximated Generation From Information Theo...mentioning

confidence: 99%

See 1 more Smart Citation

Verifiable Quantum Secure Modulo Summation

Hayashi,

Koshiba

2019

Preprint

Self Cite

View full text Add to dashboard Cite

We propose a new cryptographic task, which we call verifiable quantum secure modulo summation. Secure modulo summation is a 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. However, the conventional method for secure modulo summation uses so many secret communication channels. We say that a quantum protocol for secure modulo summation is quantum verifiable secure modulo summation when it can verify the desired secrecy condition. If we combine device independent quantum key distribution, it is possible to verify such secret communication channels. However, it consumes so many steps. To resolve this problem, using quantum systems, we propose a more direct method to realize secure modulo summation with verification. To realize this protocol, we propose modulo zero-sum randomness as another new concept, and show that secure modulo summation can be realized by using modulo zero-sum randomness. Then, we construct a verifiable quantum protocol method to generate modulo zero-sum randomness. This protocol can be verified only with minimum requirements.

show abstract

Section: Asymptotically Approximated Generation From Information Theo...mentioning

confidence: 99%

“…. , Z m only with broadcast public communication when the joint distribution satisfies a certain condition [36].…”

Section: Asymptotically Approximated Generation From Information Theo...mentioning

confidence: 99%