We improve a secret sharing scheme, which enables users select their personal keys by themselves instead of being distributed by group manager and users can reuse their personal keys no matter the shared secret is renewed or recovered. Then we apply it to design a self-healing key distribution scheme. The new scheme achieves good properties. Firstly, the scheme reduces storage overhead of perso...

It is known that perfectly secure (1-round, n-channel) message transmission (MT) schemes exist if and only if n ≥ 3t + 1, where t is the number of channels that the adversary can corrupt. Then does there exist an almost secure MT scheme for n = 2t + 1 ? In this paper, we first sum up a number flaws of the previous almost secure MT scheme presented at Crypto 2004 . We next show an equivalence be...

Collaboration across enterprises is becoming increasingly necessary in today’s competitive marketplace. Such cross-enterprise collaboration requires simultaneously rich knowledge sharing and maximal information security, an often paradoxical accord. Current approaches to information security do not effectively manage this paradox in collaborative knowledge processes that take on an emergent nat...

The main objective of a self healing scheme is to share and secure the information of any system at the same time. “Self-healing” techniques ultimately are dependable computing techniques. Specifically self-healing systems have to think for itself without human input, able to boot up backup systems. However, sharing and protection are two contradictory goals. Protection programs may be complete...

Information theoretically secure distributed storage system with quantum key distribution network and password authenticated secret sharing scheme M. Fujiwara1*, A. Waseda1, R. Nojima1, S. Moriai1, W. Ogata2 and M. Sasaki1 1National Institute of Information and Communications Technology (NICT), 4-2-1 Nukui-kita, Koganei, Tokyo 184-8795, Japan 2Tokyo Institute of Technology, 2-12-1 Ookayama, Meg...

Verifiable Secret Sharing (VSS) is a fundamental primitive used in many distributed cryptographic tasks, such as Multiparty Computation (MPC) and Byzantine Agreement (BA). It is a two phase (sharing, reconstruction) protocol. The VSS and MPC protocols are carried out among n parties, where t out of n parties can be under the influence of a Byzantine (active) adversary, having unbounded computin...

In this paper, we suggest a quantum protocol to transmit any quantum information, namely, quantum sequential ε-secure transmission scheme. The scheme is constructed via some modified quantum secret (or state) sharing method. Actually, these schemes significantly rely on the idea of approximation of the well-known private quantum channel using randomly selected n-qubit Pauli matrices. We focus o...

In this work we focus on two basic secure distributed computation tasksProbabilistic Weak Secret Sharing (PWSS) and Probabilistic Verifiable Secret Sharing (PVSS). PVSS allows a dealer to share a secret among several players in a way that would later allow a unique reconstruction of the secret with negligible error probability. PWSS is slightly weaker version of PVSS where the dealer can choose...