搜索结果: 1-2 共查到“密码学 Partial Fairness”相关记录2条 . 查询时间(0.044 秒)
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted party which returns...
Partial Fairness in Secure Two-Party Computation
Partial Fairness Secure Two-Party Computation
2009/6/4
Complete fairness is impossible to achieve, in general, in secure two-party computation. In
light of this, various techniques for obtaining partial fairness in this setting have been suggested.
We e...