Public Discussion Must Be Back and Forth in Secure Message Transmission

Koshiba, Takeshi; Sawada, Shinya

doi:10.1007/978-3-642-24209-0_22

Cited by 2 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the standard setting of perfectly secure message transmission, honest majority over the channels is required. If the broadcast public channel is available in secure message transmission, then such a barrier can be overcome [32], [33], [34] and multi-party secure computation can be realized by using secure message transmission with the broadcast public channel [35]. However, the respective simulations of the secure communication channels are quite inefficient.…”

Section: B Application Of Secure Modulo Zero-sum Randomnessmentioning

confidence: 99%

“…Secure modulo zero-sum randomness among m players can be generated from information theoretical assumption with asymptotically negligible error. A sequence of random variables X i,n ∈ F cn 2 is called secure modulo zero-sum randomness with asymptotically negligible error when D(P X1,n,...,Xm,n , P X1,n,..., Xm,n ) → 0 (34) where D is the variational distance and X1,n , . .…”

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