首页> 外文期刊>Discrete Applied Mathematics >A fair and efficient solution to the socialist millionaires' problem
【24h】

A fair and efficient solution to the socialist millionaires' problem

机译:公平有效地解决社会主义百万富翁的问题

获取原文
获取原文并翻译 | 示例
       

摘要

We present a solution to the Tierce problem, in which two players want to know whether they have backed the same combination (but neither player wants to disclose its combination to the other one). The problem is also known as the socialist millionaires' problem, in which two millionaires want to know whether they happen to be equally rich. In our solution, both players will be convinced of the correctness of the equality test between their combinations and will get no additional information on the other player's combination. Our solution is fair: one party cannot get the result of the comparison while preventing the other one from getting it. The protocol requires O(k) exponentiations only, where k is a security parameter. (C) 2001 Published by Elsevier Science B.V. [References: 19]
机译:我们为Tierce问题提供了一种解决方案,其中两个玩家想知道他们是否支持相同的组合(但是两个玩家都不想向另一个人透露其组合)。这个问题也被称为社会主义百万富翁问题,其中两个百万富翁想知道他们是否碰巧也一样富有。在我们的解决方案中,两个参与者将确信他们的组合之间的相等性测试的正确性,并且不会获得其他参与者组合的其他信息。我们的解决方案是公平的:一方无法获得比较结果,而另一方无法获得结果。该协议仅要求O(k)取幂,其中k是安全参数。 (C)2001年由Elsevier Science B.V.出版[参考文献:19]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号