搜索结果: 1-2 共查到“密码学 Computational Complexity”相关记录2条 . 查询时间(0.125 秒)
Errors in Computational Complexity Proofs for Protocols
Computational Complexity Proofs security properties of protocols assuring protocol
2009/3/9
Proofs are invaluable tools in assuring protocol implementers
about the security properties of protocols. However, several instances of
undetected aws in the proofs of protocols (resulting in awed p...
Constant Round Group Key Exchange with Logarithmic Computational Complexity
Group key exchange scalability binary tree provable security
2008/12/15
Protocols for group key exchange (GKE) are cryptographic algorithms that describe
how a group of parties communicating over a public network can come up with a common secret key.Due to their critical...