Sciweavers

120 search results - page 13 / 24
» Security Games with Protection Externalities
Sort
View
ATAL
2011
Springer
14 years 4 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
ACSAC
2004
IEEE
15 years 8 months ago
CTCP: A Transparent Centralized TCP/IP Architecture for Network Security
Many network security problems can be solved in a centralized TCP (CTCP) architecture, in which an organization's edge router transparently proxies every TCP connection betwe...
Fu-Hau Hsu, Tzi-cker Chiueh
CSFW
1998
IEEE
15 years 8 months ago
Formal Analysis of a Non-Repudiation Protocol
This paper applies the theory of Communicating Sequential Processes (CSP) to the modelling and analysis of a non-repudiation protocol. Non-repudiation protocols di er from authent...
Steve Schneider
CIKM
2010
Springer
15 years 2 months ago
Anonymizing data with quasi-sensitive attribute values
We study the problem of anonymizing data with quasi-sensitive attributes. Quasi-sensitive attributes are not sensitive by themselves, but certain values or their combinations may ...
Pu Shi, Li Xiong, Benjamin C. M. Fung
IPPS
2007
IEEE
15 years 10 months ago
Design Alternatives for a High-Performance Self-Securing Ethernet Network Interface
This paper presents and evaluates a strategy for integrating the Snort network intrusion detection system into a high-performance programmable Ethernet network interface card (NIC...
Derek L. Schuff, Vijay S. Pai