Integrity and its applications

Authors:
Qunwei Zheng;Sibabrata Ray;Xiaoyan Hong;Lei Tang;Li Gao
Affiliations:
University of Alabama, Tuscaloosa, AL;Google Inc., Santa Monica, CA;University of Alabama, Tuscaloosa, AL;University of Alabama, Tuscaloosa, AL;University of Alabama, Tuscaloosa, AL
Venue:
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Year:
2007

Citing 8
Cited 0

Linear programming and network flows (2nd ed.)

Linear programming and network flows (2nd ed.)
Byzantine quorum systems

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Code-Red: a case study on the spread and victims of an internet worm

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
On Sapphire and type-safe languages

Communications of the ACM - Digital rights management
Minimal Sensor Integrity in Sensor Grids

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

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.