搜索结果: 1-4 共查到“军事学 complete fairness”相关记录4条 . 查询时间(0.062 秒)
Towards Characterizing Complete Fairness in Secure Two-Party Computation
Complete fairness secure two-party computation foundations
2016/1/26
The well known impossibility result of Cleve (STOC 1986) implies that in general it is
impossible to securely compute a function with complete fairness without an honest majority.
Since then, the ac...
Complete Fairness in Multi-Party Computation Without an Honest Majority
Complete Fairness Multi-Party Computation Honest Majority
2009/6/9
Gordon et al. recently showed that certain (non-trivial) functions can be computed with
complete fairness in the two-party setting. Motivated by their results, we initiate a study of
complete fairne...
Complete Fairness in Secure Two-Party Computation
cryptography secure computation fairness distributed computing
2009/6/5
In the setting of secure two-party computation, two mutually distrusting parties wish to
compute some function of their inputs while preserving, to the extent possible, various security
properties s...
Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness
Efficient and Secure Multi-Party Computation Faulty Majority Complete Fairness
2009/3/20
Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness.
