Secure Modulo Zero-Sum Randomness as Cryptographic Resource

Masahito Hayashi; Takeshi Koshiba

Paper 2018/802

Secure Modulo Zero-Sum Randomness as Cryptographic Resource

Masahito Hayashi and Takeshi Koshiba

Abstract

We propose a new cryptographic resource, which we call modulo zero-sum randomness, for several cryptographic tasks. The modulo zero-sum randomness $X_{1}, \dots, X_{m}$ is distributed randomness among $m$ parties, where $X_{1}, \dots, X_{m}$ are independent of each other but holds. By using modulo zero-sum randomness, we show that multi-party secure computation for some additively homomorphic functions is efficiently realized without the majority honest nor secure communication channels (but public channel). We also construct secret sharing protocols without secure communication channels. Moreover, we consider a new cryptographic task multi-party anonymous authentication, which is realized by modulo zero-sum randomness. Furthermore, we discuss how to generate modulo zero-sum randomness from some information theoretic assumption. Finally, we give a quantum verification protocol of testing the property of modulo zero-sum randomness.

Note: Thank you for pointing out some latex errors.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint. MINOR revision.
Keywords: cryptographic resource public channel multi-party secure computation secret sharing authentication quantum verification
Contact author(s): tkoshiba @ waseda jp
History: 2018-09-06: received
Short URL: https://ia.cr/2018/802
License: CC BY

BibTeX

@misc{cryptoeprint:2018/802,
      author = {Masahito Hayashi and Takeshi Koshiba},
      title = {Secure Modulo Zero-Sum Randomness as Cryptographic Resource},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/802},
      year = {2018},
      url = {https://eprint.iacr.org/2018/802}
}