如何与诚实但好奇的法官合作？（初步报告）
How to Work with Honest but Curious Judges? (Preliminary Report)
摘要：
三法官协议，最近倡导的Mclver和摩根作为一个例子，逐步完善的安全协议，研究如何安全地计算多数函数，以达到最终的判决，而不透露每个法官的决定。我们扩展他们的协议在两个不同的方式为任意数量的2n+1法官。第一种概括本质上是集中的，因为它需要一个法官作为领导者，从其他人那里收集信息，计算多数函数，并宣布最终结果。通过稍微修改著名的用餐密码协议可以获得不同的方法，但是它显示的是投票数而不是最终判决。我们定义了一个概念的条件匿名，以分析这两个解决方案。这两个模型都已在模型检查器MCMAS中进行了检查。
英文摘要：
The three-judges protocol, recently advocated by Mclver and Morgan as an example of stepwise refinement of security protocols, studies how to securely compute the majority function to reach a final verdict without revealing each individual judge's decision. We extend their protocol in two different ways for an arbitrary number of 2n+1 judges. The first generalisation is inherently centralised, in the sense that it requires a judge as a leader who collects information from others, computes the majority function, and announces the final result. A different approach can be obtained by slightly modifying the well-known dining cryptographers protocol, however it reveals the number of votes rather than the final verdict. We define a notion of conditional anonymity in order to analyse these two solutions. Both of them have been checked in the model checker MCMAS.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
