非线性一次一密(t,n)门限秘密共享方案

(t,n) threshold secret sharing scheme for nonlinear one-time pad

针对本身不安全的线性算法构造的门限秘密共享方案存在安全漏洞的问题,以及可信方的参与容易导致单点故障和不可靠情形,结合非线性算法和密码学理论,提出一种无可信方的非线性门限秘密共享方案。方案基于混沌算法和有限状态自动机两种非线性结构,子密钥的产生具有随机性和动态性,参与者可控制每一轮的子密钥来实现一次一密或N次一密安全级别。秘密恢复由拉格朗日插值公式来实现。安全多方计算使各参与者相互牵制,不需可信方参与,满足弹性均衡,可防欺骗与合谋攻击。

To address the problem that secret sharing scheme constructed by linear algorithm has security vulnerabilities, and to solve the problem that it easily leads to a single point of failure and unreliable situations with trusted party, this paper proposed a nonlinear threshold secret sharing scheme which combined nonlinear algorithm and cryptography. The scheme was based on two nonlinear structures of chaos algorithm and finite state automata, so it can generate random and dynamic shares. Participants can control each round shares to achieve the security level of once or N times a password. Secret was recovered by the Lagrange interpolation formula. Secure multiparty computation restricted every participant so that the scheme satisfied resilient equilibrium and could withstand chicanery or conspiracy attack.