关于白盒密码学和混淆
On White-box Cryptography and Obfuscation
摘要:
我们研究了混淆和白盒密码学之间的关系。我们使用\emph{White-Box Property (WBP)}捕获任何白盒原语的需求,并给出一些否定/肯定的结果。不严格地说,WBP是为某种方案和安全概念定义的(我们称这对为\emph{specification}),这意味着w.r.t.根据规范,混淆不会泄漏任何“有用”信息,即使它可能泄漏一些“无用”的非黑盒信息。我们的主要结果是否定的-对于大多数有趣的程序,混淆(根据\emph{any}定义)不能满足WBP的每一个规范,其中程序可能存在。为此,我们定义了一个\emph{Universal White-Box Property (UWBP)},如果满足,将意味着在我们设想的\emph{whatever}规范下,WBP是满足的。然后,我们表明,对于每一个非近似可学习的家庭,存在(人为的)规格的WBP(因此,UWBP)失败。在积极的一面,我们表明,存在一个混淆器的非近似可学习的家庭,实现了一定的规范的WBP。此外,存在用于实现UWBP的不可学习(但近似可学习)家族的混淆器。我们的结果也可以被看作是正式区分“有用”和“无用”的非黑盒信息。
英文摘要:
We study the relationship between obfuscation and white-box cryptography. We capture the requirements of any white-box primitive using a \emph{White-Box Property (WBP)} and give some negative/positive results. Loosely speaking, the WBP is defined for some scheme and a security notion (we call the pair a \emph{specification}), and implies that w.r.t. the specification, an obfuscation does not leak any ``useful'' information, even though it may leak some ``useless'' non-black-box information. Our main result is a negative one - for most interesting programs, an obfuscation (under \emph{any} definition) cannot satisfy the WBP for every specification in which the program may be present. To do this, we define a \emph{Universal White-Box Property (UWBP)}, which if satisfied, would imply that under \emph{whatever} specification we conceive, the WBP is satisfied. We then show that for every non-approximately-learnable family, there exist (contrived) specifications for which the WBP (and thus, the UWBP) fails. On the positive side, we show that there exists an obfuscator for a non-approximately-learnable family that achieves the WBP for a certain specification. Furthermore, there exists an obfuscator for a non-learnable (but approximately-learnable) family that achieves the UWBP. Our results can also be viewed as formalizing the distinction between ``useful'' and ``useless'' non-black-box information.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。