Sciweavers

Share
IH
2004
Springer

Information Hiding in Finite State Machine

8 years 8 months ago
Information Hiding in Finite State Machine
In this paper, we consider how to hide information into finite state machine (FSM), one of the popular computation models. The key advantage of hiding information in FSM is that the hidden information becomes inexpensive to retrieve, yet still hard to remove or delete. This is due to the fact that verifying certain FSM properties is easy, but changing them requires efforts equivalent to redoing all the design and implementation stages after FSM synthesis. We first observe that not all the FSM specifications (or transitions) are needed during the state minimization phase. We then develop a Boolean Satisfiability (SAT) based algorithm to discover, for a given minimized FSM, a maximal set of redundant specifications. Manipulating such redundancy enables us to hide information into the FSM without changing the given minimized FSM. Moreover, when the original FSM does not possess sufficient redundancy to accommodate the information to be embedded, we propose a state duplication techni...
Lin Yuan, Gang Qu
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where IH
Authors Lin Yuan, Gang Qu
Comments (0)
books