Welcome to the resource topic for 2018/802
Title:
Secure Modulo Zero-Sum Randomness as Cryptographic Resource
Authors: Masahito Hayashi, 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, \ldots, X_m is distributed randomness among m parties, where X_1, \ldots, X_m are independent of each other but \sum X_i =0 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.
ePrint: https://eprint.iacr.org/2018/802
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .