摘要
分析了背包问题的特性,介绍了零知识和公平抛掷协议。通过证明,成功地将背包问题应用在零知识证明和公正硬币抛掷协议上,通过理论的安全性证明其具有较强的可靠性,并通过零知识证明协议的变体证明了背包问题的广泛适用性,说明了背包问题不可取代的实用价值。
In this paper, according to knapback problem's characteristics, introduce zero-knowledge proof and unbiased coin cast protocols in theroy, and apply it to zero-knowledge proof and unbiased coin cast sucessfully by proving and analysing. More, we prove its security theoretically and prove knapback has broad applicability by the extension of zero-knowledge proof, and so prove practicability of knapback problem with facts.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2003年第4期417-419,共3页
Journal of University of Electronic Science and Technology of China
基金
国家863计划资助项目
关键词
背包问题
离散对数问题
零知识证明
公正的硬币
knapback problem
discreption problem
zero-knowledge proof
unbiased coin cast protocol