搜索结果: 1-1 共查到“军事学 Cut-and-choose 2PC”相关记录1条 . 查询时间(0.328 秒)
Fast Optimistically Fair Cut-and-Choose 2PC
secure two-party computation covert adversaries cut-and-choose
2016/1/27
Secure two party computation (2PC) is a well-studied problem with many real world applications.
Due to Cleve’s result on general impossibility of fairness, however, the state-of-the-art
solutions on...