In (k, n) secret sharing scheme, any m out of the n users (m≥ k) can reconstruct the secret
and any less than k users cannot get any information on the secret. However, some cheaters …

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 …

Secret sharing is a useful method for secure distributed data storage. Such a distributed data
storage can avoid the information leakage under an attack to a limited number of distributed …

For several decades, secure multiparty computation has been the topic of extensive
research, as it enables computing any functionality in a privacy-preserving manner, while …

In the network coding, we discuss the effect by sequential error injection to information
leakage. We show that there is no improvement when the network is composed of linear …

Various adversarial scenarios have been considered in secret sharing for threshold access
structure. However, threshold access structure can not provide efficient solution when …

Komargodski et al. introduced Evolving Secret Sharing which allows an impartial participant,
called dealer, to share a secret among unbounded number of participants over any given …

For conventional secret sharing, if cheaters can submit possibly forged shares after
observing shares of the honest users in the reconstruction phase, they can disturb the …

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+\ldots+ …

When there exists a malicious attacker in the network, we need to be careful of
eavesdropping and contamination. This problem is crucial for network communication when …