Sciweavers

33 search results - page 3 / 7
» sp 2005
Sort
View
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
13 years 11 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
SP
2005
IEEE
104views Security Privacy» more  SP 2005»
13 years 11 months ago
On Safety in Discretionary Access Control
An apparently prevailing myth is that safety is undecidable in Discretionary Access Control (DAC); therefore, one needs to invent new DAC schemes in which safety analysis is decid...
Ninghui Li, Mahesh V. Tripunitara
SP
2005
IEEE
100views Security Privacy» more  SP 2005»
13 years 11 months ago
Polygraph: Automatically Generating Signatures for Polymorphic Worms
It is widely believed that content-signature-based intrusion detection systems (IDSes) are easily evaded by polymorphic worms, which vary their payload on every infection attempt....
James Newsome, Brad Karp, Dawn Xiaodong Song
SP
2005
IEEE
149views Security Privacy» more  SP 2005»
13 years 11 months ago
Distributed Proving in Access-Control Systems
We present a distributed algorithm for assembling a proof that a request satisfies an access-control policy expressed in a formal logic, in the tradition of Lampson et al. [16]. ...
Lujo Bauer, Scott Garriss, Michael K. Reiter
SP
2005
IEEE
13 years 11 months ago
Language-Based Generation and Evaluation of NIDS Signatures
We present a methodology to automatically construct robust signatures whose accuracy is based on formal reasoning so it can be systematically evaluated. Our methodology is based o...
Shai Rubin, Somesh Jha, Barton P. Miller