摘要
隐私安全的分布式约束满足问题(distributed constraint satisfaction problem,DisCSP)求解算法可以很好地满足信息敏感的分布式组合求解问题的需要,为了获得更好的求解效率,提出了一种基于权值加密的隐私安全DisCSP的求解算法,对DisCSP问题中的约束基于不同的隐私权值进行加密求解;不需要增加额外的agent进行隐私约束的一致性检查,实现分布式的安全求解策略;对于可能出现的推理信息,用随机选择策略来避免信息泄漏.试验表明,该算法可以减少信息的传递量和计算的复杂性,因而具有更好的求解效率.
Algorithms for solving secure distributed constraint satisfaction problems can meet the requirements of information security of distributed combination problems. To improve the solving efficiency, an algorithm for solving secure DisCSP based on encrypted weighted-privacy was presented. The search procedure for solution was encrypted based on weight of different constraints; to realize a real distributed secure DisCSP protocol, additional agents were not introduced to check the consistency of private constraints. Finally, random selection strategy was used to prevent reasoning information leakage. Experimental results show that the algorithm obtains better solving efficiency through reducing the amount of information communicated and the complexity of computation.
基金
国家自然科学基金(60573077)
新世纪优秀人才支持计划(NCET-05-0549)资助
关键词
分布式约束满足
隐私安全
加密
异步回退
distributed constraint satisfaction
private/secure
encrypt
asynchronously backtrack
