搜索结果: 1-2 共查到“军事学 probabilistic termination”相关记录2条 . 查询时间(0.062 秒)
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
secure multi-party computation parallel composition broadcast
2017/4/27
An important benchmark for multi-party computation protocols (MPC) is their round complexity. For several important MPC tasks, (tight) lower bounds on the round complexity are known. However, for some...
Probabilistic Termination and Composability of Cryptographic Protocols
probabilistic termination Universal Composition cryptographic protocol
2016/4/6
When analyzing the round complexity of multi-party cryptographic protocols, one often overlooks the fact that underlying resources, such as a broadcast channel, can be by themselves expensive to imple...