General Error Decodable Secret Sharing Scheme and Its Application
General Error Decodable Secret Sharing Scheme and Its Application
复制标题
DOI：
10.1109/tit.2011.2161927
复制
发表时间：
2011-09
影响因子：
2.5
通讯作者：
K. Kurosawa
中科院分区：
文献类型：
--
作者：
K. Kurosawa
考虑一个带有欺骗者的秘密共享方案的模型。如果我们仍然可以从噪声共享向量(SHAR1‘，…，Sharen’)中正确地恢复秘密S，我们说秘密共享方案是可错误译码的。在这篇文章中，我们首先证明了一个完美秘密共享方案是错误可解码的当且仅当对手结构Γ满足一个称为Q3的条件。其次，对于这样的Γ，我们证明了一个方案，使得译码算法在|S|上运行在多项式时间内，并证明了实现Γ的线性秘密共享方案的大小。最后给出了一个应用于1轮完全安全消息传输方案(PSMT)的例子。
Consider a model of secret sharing schemes with cheaters. We say that a secret sharing scheme is error decodable if we can still recover the secret s correctly from a noisy share vector (share1', ..., sharen'). In this paper, we first prove that a perfect secret sharing scheme is error decodable if and only if the adversary structure Γ satisfies a certain condition called Q3. Next, for such Γ , we show a scheme such that the decoding algorithm runs in polynomial-time in |S | and the size of a linear secret sharing scheme which realizes Γ. We finally show an application to 1-round perfectly secure message transmission schemes (PSMT).