Cryptology ePrint Archive: Report 2008/184

On the Secure Obfuscation of Deterministic Finite Automata

W. Erik Anderson

Abstract: 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 [B79,G87,GO96,K80] and revise them to the current obfuscation setting of Barak et al. [BGI+01]. 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 that securely obfuscates Deterministic Finite Automata against malicious adversaries. The security of this model retains the strong ``virtual black box" property originally proposed in [BGI+01] while incorporating the stronger condition of dependent auxiliary inputs in [GTK05]. Additionally, we further show that our techniques remain secure under concurrent self-composition with adaptive inputs and that Turing machines are obfuscatable under this model.

Category / Keywords: foundations / Obfuscation, deterministic finite automata, state machines, Turing machines, authenticated encryption, oracle machines, provable security, game-playing.

Date: received 23 Apr 2008, last revised 2 Jun 2008

Contact author: weander at sandia gov

Available format(s): PDF | BibTeX Citation

Version: 20080602:143730 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]