搜索结果: 1-1 共查到“Resettably-Sound Resettable Zero Knowledge Arguments”相关记录1条 . 查询时间(0.069 秒)
Resettably-Sound Resettable Zero Knowledge Arguments for NP
Resettably-Sound Resettable Zero Knowledge Arguments NP non-black-box
2009/6/11
We construct resettably-sound resettable zero knowledge arguments for NP based
on standard hardness assumption (the existence of claw-free permutations) in the plain model.
This proves the simultane...