搜索结果: 1-1 共查到“密码学 non-trivial efficiency”相关记录1条 . 查询时间(0.093 秒)
Indistinguishability Obfuscation with Non-trivial Efficiency
indistinguishability obfuscators XiO
2016/1/27
It is well known that inefficient indistinguishability obfuscators (iO) with running time
poly(|C|, λ) · 2
n, where C is the circuit to be obfuscated, λ is the security parameter, and n is
the inpu...
