搜索结果: 1-2 共查到“军事学 concurrent non-malleability”相关记录2条 . 查询时间(0.046 秒)
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...
Adaptive Concurrent Non-Malleability with Bare Public-Keys
Adaptive Concurrent Non-Malleability Bare Public-Keys
2010/3/16
Concurrent non-malleability (CNM) is central for cryptographic protocols running concurrently
in environments such as the Internet. In this work, we formulate CNM in the bare public-key (BPK)
model,...