A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
In this paper, we show how to construct secure obfuscation for Deterministic Finite Automata, assuming non-uniformly strong one-way functions exist. We revisit the software protection approaches originally proposed by [5, 10, 12, 17] and revise them to the current obfuscation setting of Barak et al.  . Under this model, we introduce an efficient oracle that retains some "small" secret about the original program. Using this secret, we can construct an obfuscator and two-party protocol thatdoi:10.2172/974399 fatcat:sxgtgejk6fauncxa5obzc6jur4