Proceedings 14th Annual IEEE International ASIC/SOC Conference (IEEE Cat. No.01TH8558)
DOI: 10.1109/asic.2001.954736
|View full text |Cite
|
Sign up to set email alerts
|

IP protection for VLSI designs via watermarking of routes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 30 publications
(20 citation statements)
references
References 6 publications
0
20
0
Order By: Relevance
“…[7]. At lower design levels, the approach was used even more effectively in routing [12], placement, and floor planning [9]. The main advantage of the approach is its real low overhead on the design cycle, as the NP-hard problem will be solved anyway.…”
Section: B Ip Watermarking: Related Workmentioning
confidence: 99%
“…[7]. At lower design levels, the approach was used even more effectively in routing [12], placement, and floor planning [9]. The main advantage of the approach is its real low overhead on the design cycle, as the NP-hard problem will be solved anyway.…”
Section: B Ip Watermarking: Related Workmentioning
confidence: 99%
“…Then, the scheme adds the constraints into the original design specification, with the help of a tool that retrieves the final optimized design specification. Narayan et al [12] proposed a process for embedding a watermark by modifying the number of vias or bends utilized to route the nets in a design. All these techniques embed the watermark at the physical design stage [10], [13]- [16], design partitioning [17], [18], and combinational logic synthesis [15].…”
Section: Introductionmentioning
confidence: 99%
“…In the other scheme, they attacked the FPGA watermarking proposed by Lach et al [24], where they located the embedded signature and then removed it. The authors though, did not try to attack this approach at lower levels such as placement [19] or routing [27]. We believe deleting the watermark at these levels is much harder.…”
Section: Static Watermarking Techniques: Constraint-based Ip Watermarmentioning
confidence: 99%
“…At the system level, for instance, it was used to watermark memory graph coloring problems [14], as well as graph partitioning problems [46] and linear programming problems [26]. At lower design levels, the approach was used even more heavily with routing [27], placement, and floor planning [19]. In [32], Qu developed the first public watermarking approach based on the above technique.…”
Section: Static Watermarking Techniques: Constraint-based Ip Watermarmentioning
confidence: 99%