Indistinguishability obfuscation from circular security

Indistinguishability obfuscation from circular security
复制标题

DOI:
10.1145/3406325.3451070
复制
发表时间:
2021-06
期刊:
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
影响因子:
--
通讯作者:
Romain Gay;R. Pass
Romain Gay;R. Pass
中科院分区:
其他
文献类型:
--
作者:
Romain Gay;R. Pass

文献摘要

被引文献

相似文献

我们证明了假设亚指数安全性的一般电路存在不可区分混淆器(iO):(a)有误差学习(LWE)假设(具有亚指数模噪比);(b)关于genry - sahai - waters (GSW)加密方案的循环安全猜想和Regev加密方案的压缩版本。循环安全猜想表明,在涉及GSW和打包Regev的加密密钥循环存在的情况下,我们证明了GSW假设LWE可以满足泄漏弹性安全的概念。
We show the existence of indistinguishability obfuscators (iO) for general circuits assuming subexponential security of: (a) the Learning with Errors (LWE) assumption (with subexponential modulus-to-noise ratio); (b) a circular security conjecture regarding the Gentry-Sahai-Waters' (GSW) encryption scheme and a Packed version of Regev's encryption scheme. The circular security conjecture states that a notion of leakage-resilient security, that we prove is satisfied by GSW assuming LWE, is retained in the presence of an encrypted key-cycle involving GSW and Packed Regev.