This paper proposes a(t,n)-threshold verifiable secret sharing scheme with changeable parameters based on a trapdoor one-way function.This scheme consists of a generation phase,a distribution phase,an encoding phase a...This paper proposes a(t,n)-threshold verifiable secret sharing scheme with changeable parameters based on a trapdoor one-way function.This scheme consists of a generation phase,a distribution phase,an encoding phase and a reconstruction phase.The generation and distribution phases are,respectively,based on Shamir’s and Feldman’s approaches,while the encoding phase is based on a novel trapdoor one-way function.In the reconstruction phase,the shares and reconstructed secret are validated using a cryptographic hash function.In comparison with existing schemes,the proposed scheme leaks no direct information about the secret from public information.Furthermore,unlike some existing schemes,the generation and distribution phases of the proposed scheme are both independent of the secret.This feature leads to a number of advantages over existing approaches such as the dealer’s ability to perform the following modifications without updating the shares(i)modify the secret and(ii)adjust the threshold parameters of the scheme.Furthermore,each participant receives a single share,and designated participants can be given the privilege of choosing their own shares for reconstructing a secret S.Moreover,the proposed scheme possesses a high level of security which is inherited from the schemes of Shamir and Feldman,in addition to the trapdoor one-way function and the employed cryptographic hash function.展开更多
By introducing XOR operation and one-way function chains to group key management schemes based on the keys tree, a new group key management scheme based on the keys tree, XOR operation and one-way function chains is p...By introducing XOR operation and one-way function chains to group key management schemes based on the keys tree, a new group key management scheme based on the keys tree, XOR operation and one-way function chains is proposed. Initialization, member adding and member evicting operations are introduced. The new scheme is compared with three other group key management schemes which are based on the keys tree： SKDC, LKH, and OFF. As far as transmission, computation and storage costs are concerned, the performance of the new group key management scheme is the best. The security problem of the new scheme is analyzed. This new scheme provides backward and forward security, i.e.. newly admitted group members cannot read previous multicast messages and evicted members cannot read future multicast messages, even with collusion by many arbitrarily evicted members.展开更多
The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos ...The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos characteristics is proposed. First, the chaos sequence is gotten by iterating cellular neural network with Runge Kutta algorithm, and then the chaos sequence is iterated with the message. The hash code is obtained through the corre- sponding transform of the latter chaos sequence. Simulation and analysis demonstrate that the new method has the merit of convenience, high sensitivity to initial values, good hash performance, especially the strong stability.展开更多
Let F be a meromorphic functions family on the unit disc Δ, If for every (the zeros of f is a multiplicity of at least k) and if then and ( ), then F is normal on Δ.
We studied the normality criterion for families of meromorphic functions which related to One-way sharing set, and obtain two normal criterions, which improve the previous results.
随着区块链的迅速发展,上链数据不仅包括金融交易数据,还包括科技、文化、政治等多类数据.而在现有的区块链系统中,数据一旦上链便无法更改,可能会面临失效数据无法删除、错误数据无法修改等问题.因此,特定条件下可修改的区块链方案具...随着区块链的迅速发展,上链数据不仅包括金融交易数据,还包括科技、文化、政治等多类数据.而在现有的区块链系统中,数据一旦上链便无法更改,可能会面临失效数据无法删除、错误数据无法修改等问题.因此,特定条件下可修改的区块链方案具有广阔的应用前景.在POSpace(proof of space)共识机制下,基于陷门单向函数和新型区块链结构,提出了可修改的区块链方案.只要超过阈值数的节点同意,便可实现区块数据的合法修改,否则不能进行修改.除修改数据外,其余区块数据保持不变,全网节点仍可按原始验证方式对数据合法性进行验证.仿真实验表明:只要选定合适的阈值,所提方案中,区块生成与数据修改的效率均很高,数据的修改并不改变区块之间的链接关系,具有现实可操作性.展开更多
文摘This paper proposes a(t,n)-threshold verifiable secret sharing scheme with changeable parameters based on a trapdoor one-way function.This scheme consists of a generation phase,a distribution phase,an encoding phase and a reconstruction phase.The generation and distribution phases are,respectively,based on Shamir’s and Feldman’s approaches,while the encoding phase is based on a novel trapdoor one-way function.In the reconstruction phase,the shares and reconstructed secret are validated using a cryptographic hash function.In comparison with existing schemes,the proposed scheme leaks no direct information about the secret from public information.Furthermore,unlike some existing schemes,the generation and distribution phases of the proposed scheme are both independent of the secret.This feature leads to a number of advantages over existing approaches such as the dealer’s ability to perform the following modifications without updating the shares(i)modify the secret and(ii)adjust the threshold parameters of the scheme.Furthermore,each participant receives a single share,and designated participants can be given the privilege of choosing their own shares for reconstructing a secret S.Moreover,the proposed scheme possesses a high level of security which is inherited from the schemes of Shamir and Feldman,in addition to the trapdoor one-way function and the employed cryptographic hash function.
文摘By introducing XOR operation and one-way function chains to group key management schemes based on the keys tree, a new group key management scheme based on the keys tree, XOR operation and one-way function chains is proposed. Initialization, member adding and member evicting operations are introduced. The new scheme is compared with three other group key management schemes which are based on the keys tree： SKDC, LKH, and OFF. As far as transmission, computation and storage costs are concerned, the performance of the new group key management scheme is the best. The security problem of the new scheme is analyzed. This new scheme provides backward and forward security, i.e.. newly admitted group members cannot read previous multicast messages and evicted members cannot read future multicast messages, even with collusion by many arbitrarily evicted members.
基金supported by Key Program of Natural Science Fund of Tianjin of China (Grant No 07JCZDJC06600)
文摘The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos characteristics is proposed. First, the chaos sequence is gotten by iterating cellular neural network with Runge Kutta algorithm, and then the chaos sequence is iterated with the message. The hash code is obtained through the corre- sponding transform of the latter chaos sequence. Simulation and analysis demonstrate that the new method has the merit of convenience, high sensitivity to initial values, good hash performance, especially the strong stability.
文摘Let F be a meromorphic functions family on the unit disc Δ, If for every (the zeros of f is a multiplicity of at least k) and if then and ( ), then F is normal on Δ.
文摘We studied the normality criterion for families of meromorphic functions which related to One-way sharing set, and obtain two normal criterions, which improve the previous results.
文摘随着区块链的迅速发展,上链数据不仅包括金融交易数据,还包括科技、文化、政治等多类数据.而在现有的区块链系统中,数据一旦上链便无法更改,可能会面临失效数据无法删除、错误数据无法修改等问题.因此,特定条件下可修改的区块链方案具有广阔的应用前景.在POSpace(proof of space)共识机制下,基于陷门单向函数和新型区块链结构,提出了可修改的区块链方案.只要超过阈值数的节点同意,便可实现区块数据的合法修改,否则不能进行修改.除修改数据外,其余区块数据保持不变,全网节点仍可按原始验证方式对数据合法性进行验证.仿真实验表明:只要选定合适的阈值,所提方案中,区块生成与数据修改的效率均很高,数据的修改并不改变区块之间的链接关系,具有现实可操作性.
