搜索结果: 1-3 共查到“军事学 Exact Round Complexity”相关记录3条 . 查询时间(0.093 秒)
We settle the exact round complexity of three-party computation (3PC) in honest-majority setting, for a range of security notions such as selective abort, unanimous abort, fairness and guaranteed outp...
On the Exact Round Complexity of Self-Composable Two-Party Computation
secure two-party computation concurrent security exact round complexity
2017/2/20
In contrast, round complexity of secure computation in the concurrent setting, where several protocols may run simultaneously, is poorly understood. Since standard polynomial time simulation is imposs...
The Exact Round Complexity of Secure Computation
Exact Round Complexity Multi-Party Computation Two-Party Computation
2016/3/9
We revisit the exact round complexity of secure computation in the multi-party and twoparty
settings. For the special case of two-parties without a simultaneous message exchange channel, this
questi...