Nearest Edge Data Obfuscation Algorithm Based on DFS

Lei Tan · Microelectronics & Computer · 2010

This paper put forward a data obfuscation algorithm based on Depth First Searching.This algorithm create neighborhood tree through DFS algorithm and choose the nearest edge distance path in DFS Spanning tree,than substitute the original data with the data from nearest path.With regard to the identical data items,this paper use wide ranges of approaches concurrently for obfuscating the database.This algorithm break through simple data distortion of original obfuscation techniques and strengthen the complexity of reverse engineering for protecting the information.

Read the paper · More papers on PaperTik