Integrity and its applications

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Integrity and its applications

Full text

Pdf (483 KB)

Source

ACM Southeast Regional Conference archive
Proceedings of the 45th annual southeast regional conference table of contents

Winston-Salem, North Carolina

SESSION: Papers table of contents

Pages: 350 - 354

Year of Publication: 2007

ISBN:978-1-59593-629-5

Authors

Qunwei Zheng	University of Alabama, Tuscaloosa, AL
Sibabrata Ray	Google Inc., Santa Monica, CA
Xiaoyan Hong	University of Alabama, Tuscaloosa, AL
Lei Tang	University of Alabama, Tuscaloosa, AL
Li Gao	University of Alabama, Tuscaloosa, AL

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 23, Citation Count: 0

Additional Information:

abstract references 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/1233341.1233405 What is a DOI?

ABSTRACT

Integrity is a recently proposed concept used for measuring robustness of computer systems under the attack of costconscious adversaries. It considers both the cost of compromising components and the benefit of remaining components. This paper studies several integrity related problems and extends integrity to the general adversary structure model. Computation complexity of these problems is discussed.

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	Mokhtar S. Bazaraa , John J. Jarvis , Hanif D. Sherali, Linear programming and network flows (2nd ed.), John Wiley & Sons, Inc., New York, NY, 1990
	2	L. Gao and G. Malewicz. Toward maximizing the quality of results of dependent tasks computed unreliably. Theory of Computing Systems, to appear 2007.
	3	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	4	Martin Hirt , Ueli Maurer, Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract), Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.25-34, August 21-24, 1997, Santa Barbara, California, United States [doi>10.1145/259380.259412]
	5	Rajgopal Kannan , Sudipta Sarangi , Sibabrata Ray , S. S. Iyengar, Minimal Sensor Integrity in Sensor Grids, Proceedings of the 2002 International Conference on Parallel Processing (ICPP'02), p.567, August 18-21, 2002
	6	Dahlia Malkhi , Michael Reiter, Byzantine quorum systems, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.569-578, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258650]
	7	David Moore , Colleen Shannon , k claffy, Code-Red: a case study on the spread and victims of an internet worm, Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, November 06-08, 2002, Marseille, France [doi>10.1145/637201.637244]
	8	S. Ray, Q. Zheng, X. Hong, and K. Kwiat. Integrity function - a framework for server replication and placement in adversarial environment. In technical report.
	9	Andrew Wright, On Sapphire and type-safe languages, Communications of the ACM, v.46 n.4, April 2003 [doi>10.1145/641205.641237]