搜索结果: 1-1 共查到“密码学 Poly-logarithmic Rounds”相关记录1条 . 查询时间(0.05 秒)
Concurrent Zero-Knowledge in Poly-logarithmic Rounds
Concurrent Zero-Knowledge Poly-logarithmic Rounds
2009/4/17
A proof is concurrent zero-knowledge if it remains zero-knowledge when run in an
asynchronous environment, such as the Internet. It is known that zero-knowledge is
not necessarily preserved in such ...