搜索结果: 1-1 共查到“密码学 concurrent non-malleability”相关记录1条 . 查询时间(0.052 秒)
Round Optimal Concurrent Non-Malleability from Polynomial Hardness
non-malleable commitments polynomial three round
2017/8/2
Non-malleable commitments are a central cryptographic primitive that guarantee security against man-in-the-middle adversaries, and their exact round complexity has been a subject of great interest. Pa...