搜索结果: 1-1 共查到“军事学 Logarithmic Round-Complexity”相关记录1条 . 查询时间(0.098 秒)
Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity
Concurrent Zero Knowledge Proofs Logarithmic Round-Complexity
2009/4/14
We consider the problem of constructing Concurrent Zero Knowledge Proofs [6], in which the fascinating
and useful “zero knowledge” property is guaranteed even in situations where multiple concurrent
...