搜索结果: 1-1 共查到“密码学 polynomial runtime”相关记录1条 . 查询时间(0.066 秒)
Polynomial Runtime and Composability
Universal composability polynomial runtime multi-party protocols
2009/6/11
To prove security of a multi-party cryptographic protocol, one often reduces
attacks on the protocol to attacks on a suitable computational problem. Thus, if the computational problem is hard, then t...