- 1、本文档共22页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
(Im)possibilityofSoftwareObfuscation-BoazBarak.ppt
On The (Im)possibility of Software Obfuscation Boaz Barak * Joint work with Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan and Ke Yang. An obfuscator: An algorithm O such that for any program P , O(P) is a program such that: O(P) has the same functionality as P O(P) is infeasible to analyze / “reverse-engineer”. Intuition: an obfuscator should provide a “virtual black-box” in the sense that giving someone O(P) should be equivalent to giving her a black-box that computes P. What Is an Obfuscator? Why Might Obfuscators Exist? Practical Reasons: Understanding code is very difficult Obfuscation used (successfully?) in practice for security purposes Theoretical Reasons: All canonical hard problems are problems of reverse engineering: SAT, HALTING Rice’s Theorem: You can’t look at the code (Turing Machine description) of a function and find out a non-trivial property of it. Applications for Obfuscators Distributing music on-line Removing Random Oracles for specific natural protocols. Converting a private key encryption to a public key encryption Give someone ability to sign/decrypt a restricted subset of the message space. Private (Shared) Key Encryption ? Public Key Encryption Ek m Dk c m Private Key Encryption Scheme: CPA (Chosen Plaintext Attack) Security: Ek A c m Ee m Dd c m Public Key Encryption Scheme: Security: e A c m The Conversion E’e m D’d c m Instead of publishing the key k, publish e=O(Ek) Security of The Converted Scheme Ek A c m A’ c m e=O(Ek) Defining Obfuscators Definition 1 An algorithm O is an obfuscator if for any circuit C: (functionality) O(C) ~ C (i.e., O(C) computes the same function as C) (polynomial slowdown) |O(C)| ? p(|C|) for some polynomial p( ). We say that O is efficient if it runs in polynomial time. Defining Security A Natural Formal Interpretation: For any adversary A there’s a simulator S such that for any circuit C A(O(C)) ?C.I. SC(1|C|) “Anything that can be learned from the obfuscated form, coul
文档评论(0)