搜索结果: 1-1 共查到“密码学 Unbounded Memory”相关记录1条 . 查询时间(0.062 秒)
Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
Turing Machines Unbounded Memory
2016/1/6
We show how to build indistinguishability obfuscation (iO) for Turing Machines where the overhead
is polynomial in the security parameter λ, machine description |M| and input size |x| (with only a
n...