Data security for Web-based CAD

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Data security for Web-based CAD

Full text

Pdf (199 KB)

Source

Annual ACM IEEE Design Automation Conference archive
Proceedings of the 35th annual Design Automation Conference table of contents

San Francisco, California, United States

Pages: 788 - 793

Year of Publication: 1998

ISBN:0-89791-964-5

Authors

Scott Hauck	Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL
Stephen Knol	Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL

Sponsors

SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CS : Computer Society

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 46, Citation Count: 8

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/277044.277242 What is a DOI?

ABSTRACT

Internet-based computing has significant potential for improving most high-performance computing, including VLSI CAD. In this paper we consider the ramifications of the Internet on electronics design, and develop two models for Web-based CAD. We also investigate the security of these systems, and propose methods for protection against threats both from unrelated users, as well as from the CAD tools and tool developers themselves. These techniques provide methods for hiding unnecessary information. Such techniques will be key to the development of future Internet-based CAD applications, since serious CAD users will be unwilling to use any CAD methodology that risks exposing their designs to outsiders. By enabling Web-based CAD, these techniques can improve CAD performance, enable collaboratory design, and create a usage-based pricing methodology.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Charles J. Alpert , Andrew B. Kahng, Recent directions in netlist partitioning: a survey, Integration, the VLSI Journal, v.19 n.1-2, p.1-81, Aug. 1995 [doi>10.1016/0167-9260(95)00008-4]
	2	C. Barrett, D. Dill, J. Levitt,SVC, http://agamemnon, stanford.edu/levitt/vc, html, 1997.
	3	D. Chakrabarti, P. Joisha, P. Banerjee,The WADE Project, http://cpdcser.ece.nwu, edu:8080/WADE/wade.html, 1997.
	4	J. Cooley, "SPY vs. SPY: the VMC Story",Integrated systemDesign, Vol. 8, No. 90, pp.56-64, December, 1996.
	5	Morgan Enos , Scott Hauck , Majid Sarrafzadeh, Replication for logic bipartitioning, Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, p.342-349, November 09-13, 1997, San Jose, California, United States
	6	J. Gateley, "Logic Emulation Aids Design Process"ASIC & EDA, July, 1994.
	7	David Lidsky , Jan M. Rabaey, Early power exploration—a World Wide Web application, Proceedings of the 33rd annual conference on Design automation, p.27-32, June 03-07, 1996, Las Vegas, Nevada, United States [doi>10.1145/240518.240523]
	8	DavidLidsky, PowePlay, http://infopad.eecs, berkeley.edufPowerPlay, 1997.
	9	P. Losleben, D. Boning, A. Bhandarkar, A. Gower, H. Huang, E. Jhong, J. Jovanovic, P.-F. Lam, M.Mclkath, W. Moyne, S. Narayan, L. Wang, S. Wang, T.Wu, E. Zhou, NationalResearchEnterprise, http://www-snf, stanford, edul ComputationalPrototyping/comproto/nre.html, 1997.
	10	A. R. Newton, F. Chan, N. Ghazal, M. Horton, H. Hse, A. Hsia, S. Leung, K. Nguyen, M. Shilman, M. Spiller, S. Szollar, J. Young, J. Zhang, Weld, http://wwwcad. eecs.berkeley.edu/Respep/Research/weld, 1997.
	11	K. Saraswat, J. P. McVittie, W. Abdel-Ati, S. Alxtollahi- Alibeik, D. Bang, P. Canupp, J. Han, Z.-KHsiau, M. Josh, P. Kapur, S. Ma, B. Shieh, Speedie, http://speedie, stanford, edu, 1997.
	12	TheProgrammableLogicDataBook, San Jose, CA: Xilinx, Inc., 1994

CITED BY 8

	Vijay Lakamraju , Russell Tessier, Tolerating operational faults in cluster-based FPGAs, Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays, p.187-194, February 10-11, 2000, Monterey, California, United States
	Marcello Dalpasso , Alessandro Bogliolo , Luca Benini, Virtual simulation of distributed IP-based designs, Proceedings of the 36th ACM/IEEE conference on Design automation, p.50-55, June 21-25, 1999, New Orleans, Louisiana, United States
	A. Fin , F. Fummi, Protected IP-core test generation, Proceedings of the 12th ACM Great Lakes symposium on VLSI, April 18-19, 2002, New York, New York, USA
	Alessandro Fin , Franco Fummi, A Web-CAD methodology for IP-core analysis and simulation, Proceedings of the 37th conference on Design automation, p.597-600, June 05-09, 2000, Los Angeles, California, United States
	Marcello Dalpasso , Alessandro Bogliolo , Luca Benini, Virtual Simulation of Distributed IP-Based Designs, IEEE Design & Test, v.19 n.5, p.92-104, September 2002
	Annette Reutter , Wolfgang Rosenstiel, An efficient reuse system for digital circuit design, Proceedings of the conference on Design, automation and test in Europe, p.9-es, January 1999, Munich, Germany
	Marcello Dalpasso , Alessandro Bogliolo , Luca Benini, Specification and validation of disstributed IP-based designs with JavaCAD, Proceedings of the conference on Design, automation and test in Europe, p.132-es, January 1999, Munich, Germany
	M. taner Eskil , Jon Sticklen , Clark Radcliffe, The routine design–modular distributed modeling platform for distributed routine design and simulation-based testing of distributed assemblies, Artificial Intelligence for Engineering Design, Analysis and Manufacturing, v.22 n.1, p.1-18, January 2008