On the Complexity of the Circuit Obfuscation Problem for Split Manufacturing
Recent work in the area of computer hardware security introduced a number of interesting computational problems in the context of directed acyclic graphs (DAGs). In this thesis, we pick one of these problems, circuit obfuscation --- a combinatorial optimization problem --- and study its computationa...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2014
|
| Online Access: | http://hdl.handle.net/10012/8335 |