改进的基于二叉树的无交互防欺骗检测方法  

Improved Non-interactive Uncheatable Detecting Scheme Based on Bin-tree

作　　者：黄德才[1] 陈建武[1] 刘端阳[1] 

机构地区：[1]浙江工业大学信息工程学院,杭州310032

出　　处：《计算机工程》2008年第14期44-46,共3页Computer Engineering

基　　金：浙江省自然科学基金资助项目(Y105109;Y105118);浙江省教育厅基金资助项目(20051397)

摘　　要：针对一个已有的基于二叉树的无交互防欺骗检测方法进行改进。考虑用户实际诚实计算所花费的开销,把用户没有计算但猜中计算结果的概率计算在内,使进行欺骗的代价大于诚实计算所有任务的代价,用户从欺骗中得不到任何好处,从而达到防止欺骗的目的。改进后的方法比原方法需要更少的样本。This paper extends an existed non-interactive sampling scheme based on bin-tree to suit the actual situation. It takes the cost of participant truthfully computing a subset of D into account, and also adds the probability that the participant can guess the correct result of f（x）, to make the cost of conducting the cheating more expensive than the cost of conducting all the required computations, therefore the cheating brings no benefit. The improved scheme needs fewer samples than the former scheme.

关 键 词：防欺骗 二叉树 网格计算 无交互 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]