摘要:
Along with the distributed computation becoming more and more popular,security mechanisms of the distributed RSA key computation to enhance the strength of distributed authentication and data privacy have been developed quite a lot. However,most of them are the solutions for parties with traditional types like being semihonest or malicious. We propose a rational approach to dealing with the distributed computation of the RSA private key based on the secret sharing of the Euler totient function over polynomials,in which each player evolved is selfish and motivated to gain interest as mush as possible. The achievement is that it is a Nash equilibrium that each player follows the execution of the prescribed protocol. And the strategy survives the iterated deletion of weakly dominated strategies
展开
本文发布于:2024-01-30 03:00:49,感谢您对本站的认可!
本文链接:https://www.4u4v.net/it/170655485418752.html
版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。
留言与评论(共有 0 条评论) |