Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. In: CRYPTO. (2001) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Folklore Confirmed: Reducible Flow Graphs are - Larry (Correct)
.... at this question by our interest in software obfuscation [10, 11] A software obfuscator is an automatic technique that transforms programs into functionally equivalent variants that are more di#cult to understand or analyze [10, 11] Obfuscation can be shown to be theoretically impossible [7], given enough computational power and memory. This has not deterred attempts to construct obfuscators that have embedded instances of hard problems. For example, 8] shows that an instance of a PSPACE hard problem may be embedded in the control flow of the obfuscated program. As another example, ....
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Proceedings of CRYPTO, 2001.
Attacking an Obfuscated Cipher By Injecting Faults - Jacob, Boneh, Felten (7 citations) (Correct)
....a software implementation measures to what extent the implementation resists arbitrary or deliberate modifications. For example, an implementation can be protected 11 from removing a copy protection mechanism. Thus, obfuscation is a common technique for improving tamper resistance. Barak et al. [16] give a formal definition of obfuscation using a black box approach which is the ideal case. They show that in their model, that obfuscation is not possible. Encrypting the executable binary [11] is the most common approach for hiding code. In binary encryption the program is encrypted and ....
....input some tamper resistant code and attempt to break the tamper resistance. Currently no such benchmark exists and there is no clear model for building such a benchmark. One of the main open problems in code obfuscation is to come up with a model for obfuscation that can be realized in practice. [16] defines obfuscation using a black box model that hides all properties of a program. They show that it is not possible to achieve obfuscation in that model. For practical purposes a black box model might not always be necessary. In the example of the obfuscated DES cipher in this paper we only ....
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. Lecture Notes in Computer Science, 2139:1--18, 2001.
On Watermarking Semi-Structures - Sion, Atallah, Prabhakar (2001) (1 citation) (Correct)
....In the same class of binary code related information hiding, worth mentioning are the techniques for obfuscation. In this case, the hidden information is the algorithm itself, protected from disallowed decompilation disassembly reverse engineering. Relevant to this is the work of Barak and others [4] discussing the (Im)possibility of Obfuscating Programs . The tamperproo ng approach of [6] inserts a static (possibly encrypted and stored as 17 data) watermark that is subsequently protected at runtime by the software s self protection run time mechanisms that detect and react to any such ....
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs, 2001.
Mobile Agent Security - Borselius (2002) (5 citations) (Correct)
....data. Sander and Tschudin therefore suggest combining the method with undetachable signatures (see below) Although the idea is straightforward, the trick is to find appropriate encryption schemes that can transform functions as intended; this remains a research topic. Recently Barak et al. [1] has shown that it is unlikely that this approach will succeed. Obfuscated code Hohl [9] proposes what he refers to as Blackbox security to scramble an agent s code in such a way that no one is able to gain a complete understanding of its function. However, no general algorithm or approach ....
Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (Im)possibility of Obfuscating Programs. In J. Kilian, editor, Proceedings of the 21st Annual International Cryptology Conference, Santa Barbara, California, USA, volume 2139 in LNCS, pages 1--18, Springer-Verlag, Berlin, 2001.
Watermarking, Tamper-Proofing, and Obfuscation - Tools for .. - Collberg, Thomborson (2000) (7 citations) (Correct)
....technique to extract sensitive data from the client, or to otherwise violate its integrity. The only limiting factors are the computational resources the host can expend on analyzing the client code. While it is generally believed that complete protection of client code is an unattainable goal [7], recent results (by ourselves and others) have shown that some degree of protection can be achieved. Recently, software watermarking [22,28,35,60] tamper proofing [5,6,38,77] and obfuscation [20,23 25,38,49,65, 92] have emerged as feasible technical means for the intellectual property ....
....described in this paper provide at least a modicum of protection for software against attacks by malicious hosts. Future research will show exactly which attacks these methods are vulnerable to, and to what extent they can be improved. Particularly interesting are recent theoretical results [7,36,61] which point the way towards a deeper understanding of the limits of software protection. Acknowledgement. We are grateful for the extensive and insightful comments of two anonymous referees. ....
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs (extended abstract). In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, 2001. LNCS 2139.
Software Watermarking: Protective Terminology - Nagra, Thomborson, Collberg (2001) (1 citation) (Correct)
....how much computation and time an attacker is forced to spend in removing a watermark without damaging the original source. Theoretical computer scientists have recently made some intriguing arguments about the impossibility of making a watermark that will withstand an indefinitely sustained attack [Barak et al. 2001]. 6.3 Perceptibility Originally,watermarks were such that they were easily apparenttoa viewer. It is common for software to display a copyright notice, whichisatype of visible, static watermark as it starts up or as an easily accessible menu option. Authentication Watermarking Licensing ....
Barak, B. et al. (2001). On the (im)possibility of obfuscating programs (extended abstract). Available http://www.wisdom. weizmann.ac.il/~oded/obfuscate.html, August 2001.
Private Circuits II: Keeping Secrets In Tamperable.. - Ishai, Prabhakaran.. (2006) Self-citation (Sahai) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. CRYPTO 2001, 2001.
Positive Results and Techniques for Obfuscation - Lynn, Prabhakaran, Sahai (2004) (1 citation) Self-citation (Sahai) (Correct)
No context found.
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. In Proceedings of CRYPTO 2001.
Private Circuits: Securing Hardware against Probing Attacks - Ishai, Sahai, Wagner (2003) (2 citations) Self-citation (Sahai) (Correct)
....broken by cryptanalysis. OUR MODEL. Ideally, we would like to achieve security against an all powerful attacker, i.e. one that can observe every internal value produced during the computation. However, this task is generally impossible to achieve, as follows from the impossibility of obfuscation [4]. Instead, we settle for achieving security against adversaries that are limited in their power to observe the computation. There are many ways we could consider limiting the adversary, but in this paper we choose a simple metric: a t limited adversary is one that can observe at most t wires of ....
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. CRYPTO 2001, 2001.
In Search of an Easy Witness: Exponential Time vs.. - Impagliazzo, Kabanets Self-citation (Impagliazzo) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In J. Kilian, editor, Advances in Cryptology -- CRYPTO'2001, volume 2139 of Lecture Notes in Computer Science, pages 1--18. Springer-Verlag, Berlin, Germany, 2001.
How to Go Beyond the Black-Box Simulation Barrier - Barak (2001) (44 citations) Self-citation (Barak) (Correct)
....by Kilian [Kil92] Kil95] and Micali [Mic94] Dwork, Naor, Reingold and Stockmeyer [DNRS99] have explored some connections between the existence of non black box 3 round zero knowledge arguments and other problems in cryptography. Some other non black box results were shown by Barak et al. [BGI 01] in the context of code obfuscation. 1.2 Organization of this paper Section 2 contains an overview of the main part in our construction. This section does not contain proofs, and is independent of the rest of the paper. 2 Actually in this paper we need to require that there exist hash ....
....verifier s code, although it applies some non trivial transformations (such as a PCP reduction and a Cook Levin reduction) to this code. Yet, we see that even without doing true reverse engineering, one can achieve results that are impossible in a black box model. This is in a similar vein to [BGI 01] where the impossibility of code obfuscation is shown without doing true reverseengineering. One may hope to be able to define a model for an enhanced black box simulator that would be strong enough to allow all the techniques we used, but weak enough to prove impossibility results that ....
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahay, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. To appear in CRYPTO
On the (Im)possibility of Obfuscating Programs - Barak, Goldreich.. (2001) (4 citations) Self-citation (Barak Goldreich Rudich Sahai Vadhan Yang Im) (Correct)
....schemes, and pseudorandom function families. Keywords: cryptography, complexity theory, software protection, homomorphic encryption, Rice s Theorem, software watermarking, pseudorandom functions, statistical zero knowledge # An extended abstract of this work is to appear in CRYPTO 2001 [BGI 01] Department of Computer Science, Weizmann Institute of Science, Rehovot, ISRAEL. E mail: boaz,oded wisdom.weizmann.ac.il # Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA 92093 0114. E mail: russell cs.ucsd.edu Computer Science ....
Boaz Barak, Oded Goldreich, Russell Impagaliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. In J. Kilian, editor, Advances in Cryptology---CRYPTO '01, Lecture Notes in Computer Science. Springer-Verlag,
On the (Im)possibility of Obfuscating Programs - Barak, Goldreich.. (2001) (4 citations) Self-citation (Barak Goldreich Rudich Sahai Vadhan Yang Im) (Correct)
No context found.
Boaz Barak, Oded Goldreich, Russell Impagaliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. In J. Kilian, editor, Advances in Cryptology|CRYPTO '01, Lecture Notes in Computer Science. Springer-Verlag, 2001, August 2001. To appear.
From Weak to Strong Watermarking - Hopper, Molnar, Wagner (2006) (Correct)
No context found.
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. In: CRYPTO. (2001)
From Weak to Strong Watermarking - Hopper, Molnar, Wagner (2006) (Correct)
No context found.
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In Kilian, J., ed.: CRYPTO. Volume 2139 of Lecture Notes in Computer Science., Springer (2001) 1--18
Fundamental Problems in Provable - Security And Cryptography (2006) (Correct)
No context found.
Barak, B., Goldrecih, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S. & Yang K. 2001 On the (im)possibility of obfuscating programs. In Advances in Cryptology - CRYPTO 2001, Proc. 21st Annual International Cryptology Conference, Santa Barbara, California, USA, 19--23 August 2001 (ed. J. Kilian). Springer-Verlag Lecture Notes in Computer Science, no. 2139, pp. 1--18.
Obfuscated Ciphertext Mixing - Adida, Wikström (2005) (Correct)
No context found.
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahay, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. In Crypto '01, pages 1--18, 2001. LNCS No. 2139.
An Authentication Protocol for Mobile Agents Using Bilinear.. - Saxena, Soh (2005) (Correct)
No context found.
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. Cryptology ePrint Archive, Report 2001.
Manufacturing Opaque Predicates in Distributed Systems.. - Anirban Majumdar Clark (Correct)
No context found.
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., & Yang, K. (2001), On the (Im)possibility of Obfuscating Programs, In the proceedings of CRYPTO-2001. LNCS Volume 2139, Springer-Verlag. Santa Barbara, CA, USA Chow, S., Gu, Y., Johnson, H. & Zakharov, V.A.
White-Box Cryptography and an AES Implementation - Chow, Eisen, Johnson, van.. (2002) (4 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, K. Yang, On the (Im)possibility of Obfuscating Programs, pp. 1-18, Advances in Cryptology { Crypto 2001 (lncs 2139), Springer-Verlag, 2001.
Revisiting Software Protection - van Oorschot (2003) (2 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, K. Yang, \On the (Im)possibility of Obfuscating Programs", pp. 1-18, Advances in Cryptology { Crypto 2001, Springer LNCS 2139 (2001).
White-Box Cryptography and an AES Implementation - Chow, Eisen, Johnson, van.. (2002) (4 citations) (Correct)
No context found.
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, Ke Yang, On the (Im)possibility of Obfuscating Programs, pp. 1-18, Advances in Cryptology { Crypto 2001 (lncs 2139) Springer-Verlag, 2001.
A White-Box DES Implementation for DRM Applications - Chow, Eisen, Johnson, van.. (2002) (4 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, K. Yang, On the (Im)possibility of Obfuscating Programs, pp. 1-18 in: Advances in Cryptology --- Crypto 2001 (lncs 2139), Springer-Verlag, 2001.
Revisiting Software Protection - van Oorschot (2003) (2 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, K. Yang, \On the (Im)possibility of Obfuscating Programs", pp. 1-18, Advances in Cryptology { Crypto 2001, Springer LNCS 2139 (2001).
A White-Box DES Implementation for DRM Applications - Chow, Eisen, Johnson, van.. (2003) (4 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, K. Yang, On the (Im)possibility of Obfuscating Programs, pp. 1-18 in: Advances in Cryptology | Crypto 2001 (lncs 2139), Springer-Verlag, 2001.
White-Box Cryptography and an AES Implementation - Chow, Eisen, Johnson, van.. (2002) (4 citations) (Correct)
No context found.
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, Ke Yang, On the (Im)possibility of Obfuscating Programs, pp. 1-18, Advances in Cryptology -- Crypto 2001 (lncs 2139) Springer-Verlag, 2001.
Making Mobile Code Both Safe and Efficient - Franz, Amme, Beers, Dalton.. (2003) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. Lecture Notes in Computer Science, 2139, 2001.
RDS: Remote Distributed Scheme for Protecting Mobile Agents - Dadon-Elichai (2004) (Correct)
No context found.
Barak, B., Goldreich, O., Impagaliazzo, R., Rudich, S., Sahai, A., Vadhan, S., and Yang, K. On the (im)possibility of obfuscating programs. LNCS, Vol. 2139, 2001, 1-18.
Towards a Theory of Data Entanglement - Aspnes, Feigenbaum, Yampolskiy.. (2004) (1 citation) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology - Proceedings of CRYPTO 2001.
Static Analysis of Executables to Detect Malicious Patterns - Christodorescu, Jha (2003) (8 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology - CRYPTO `01, volume 2139 of Lecture Notes in Computer Science, pages 1 -- 18, Santa Barbara, CA, August 2001. Springer-Verlag.
Static Analysis of Executables to Detect Malicious Patterns - Christodorescu, Jha (2003) (8 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology (CRYPTO'01), volume 2139 of Lecture Notes in Computer Science, pages 1 -- 18. Springer-Verlag, August 2001.
Digital Rights Movement and Code Obfuscation - Sethi (2003) (Correct)
No context found.
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S. Yang, K., On the (Im)possibility of Obfuscating Programs, pp. 1-18 in: Advances in Cryptology - Crypto
Architectural Support for Copy and Tamper-Resistant Software - Lie (2003) (49 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. Lecture Notes in Computer Science, 2139, 2001. 1, 3.6.2
Making Mobile Code Both Safe and Efficient - Franz, Amme, Beers, Dalton.. (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. Lecture Notes in Computer Science, 2139, 2001.
Towards a Theory of Data Entanglement - Ed (2004) (Correct)
No context found.
B. Barak, O. Goldreich, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology - Proceedings of CRYPTO 2001, 2001.
School of Computing Science, - University Of Newcastle (Correct)
No context found.
B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, and K Yang. On the (im)possibility of obfuscating programs (extended abstract). In J. Kilian, editor, Advances in Cryptology, CRYPTO '01, Lecture Notes in Computer Science. Springer-Verlag, 2001.
Towards a Theory of Data Entanglement - Aspnes, Feigenbaum, Yampolskiy.. (2004) (1 citation) (Correct)
No context found.
B. Barak, O. Goldreich, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology - Proceedings of CRYPTO 2001.
RDS: Remote Distributed Scheme for Protecting Mobile - Dadon-Elichai (2004) (Correct)
No context found.
Barak, B., Goldreich, O., Impagaliazzo, R., Rudich, S., Sahai, A., Vadhan, S., and Yang K. On the (im)possibility of obfuscating programs. LNCS, Vol. 2139, 2001, 1-18.
Multi-Agent System Security for Mobile Communication - Borselius (2003) (Correct)
No context found.
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. In J. Kilian, editor, Advances in Cryptology -- Crypto 2001.
Systematic Development of a Family of Fair Exchange Protocols - Paul Ezhilchelvan And (2003) (1 citation) (Correct)
No context found.
B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, and K Yang. On the (im)possibility of obfuscating programs (extended abstract). In J. Kilian, editor, Advances in Cryptology, CRYPTO '01, Lecture Notes in Computer Science. Springer-Verlag, 2001.
Multi-Agent System Security for Mobile Communication - Borselius (2003) (Correct)
No context found.
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. In J. Kilian, editor, Advances in Cryptology -- Crypto 2001.
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial .. - Razborov (2003) (7 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Proceedings of the 21st Annual International Cryptology Conference, pages 1-18, 2001.
Implementing an Untrusted Operating System on Trusted Hardware - Lie, Thekkath, Horowitz (2003) (6 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. Lecture Notes in Computer Science, 2139, 2001.
Folklore Confirmed: Reducible Flow Graphs are.. - Carter, Ferrante.. (2003) (Correct)
No context found.
B.Barak,O.Goldreich,R.Impagliazzo,S.Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Proceedings of CRYPTO, 2001.
Making Mobile Code Both Safe and Efficient - Franz, Amme, Beers, Dalton.. (2003) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. Lecture Notes in Computer Science, 2139:1--??, 2001.
Towards a Theory of Data Entanglement - Aspnes, Feigenbaum, Yampolskiy.. (2004) (1 citation) (Correct)
No context found.
B. Barak, O. Goldreich, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology - Proceedings of CRYPTO 2001.
A Comparative Study of Software Protection Tools Suited for.. - Hachez (2003) (1 citation) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (Im)possibility of Obfuscating Programs. In J. Kilian, editor, Advances in Cryptology -- CRYPTO '01, volume 2139 of Lectures Notes in Computer Science (LNCS), pages 1--18. SpringerVerlag, 2001. 43, 65
On the (In)security of the Fiat-Shamir Paradigm - Goldwasser, Taumann (2003) (10 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Rudich, A. Sahai, S. Vadhan, and K.Yang. On the (im)possibility of obfuscating programs. In Crypto 2001.
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial .. - Razborov (2003) (7 citations) (Correct)
No context found.
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Proceedings of the 21st Annual International Cryptology Conference, pages 1--18, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC