摘要
为抵抗通常的攻击,用于密码体制的函数应具有高的代数次数.基于Stinson的秘密共享模型,研究了无条件安全下的欺骗免疫秘密共享.利用级联满足一定条件的线性函数,构造了代数次数大于2的k-欺骗免疫秘密共享的定义函数,所给出的函数是相关免疫度为k的平衡函数,而且满足k-强扩散准则.
Cheating immune secret sharing in the unconditionally secure case was investigated. Secret sharing is a k-cheating immune if any k cheaters are not better off than a participant which follows the protocol honestly, k-cheating immune secret sharing scheme under the unconditionally secure would be given. The obtained function of the secret sharing scheme is k-resilient and satisfies k-strengthened propagation criterion. Furthermore, its degree is high. So it has better cryptographic properties thanthat of the known results.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2005年第4期83-86,共4页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(60373059)
高等学校博士学科点专项基金项目(20040013007)
关键词
秘密共享
(强)扩散准则
相关免疫函数
弹性函数
secret sharing
（strengthened） propagation criterion
correlation immune functions
resilient functions
