Sciweavers

5511 search results - page 31 / 1103
» Security for Network Places
Sort
View
CCS
2003
ACM
14 years 3 months ago
k-anonymous message transmission
Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down it...
Luis von Ahn, Andrew Bortz, Nicholas J. Hopper
SP
1996
IEEE
140views Security Privacy» more  SP 1996»
14 years 2 months ago
A Security Model of Dynamic Labeling Providing a Tiered Approach to Verification
In the proposed mandatory access control model, arbitrary label changing policies can be expressed. The relatively simple model can capture a wide variety of security policies, in...
Simon N. Foley, Li Gong, Xiaolei Qian
ATAL
2010
Springer
13 years 11 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
EUROCRYPT
2007
Springer
14 years 4 months ago
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
Jonathan Katz
SMC
2007
IEEE
14 years 4 months ago
Network security project management: a security policy-based approach
— Managing security projects is a delicate activity due to the evolution of attacks. In this paper, we develop a new methodology for estimating security effort based on algebraic...
Jihène Krichène, Noureddine Boudriga