5255 search results - page 670 / 1051 » Formal Methods for Privacy |
181
click to vote
COLING
1992
15 years 8 months ago
1992
The normal method for representing anaphoric dependencies in Unification Based grammar tbrmalisms is that of re-entrance. In this paper, we address the problems that this represen...
165
Voted
DSD
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract—Continuously shrinking feature sizes cause an increasing vulnerability of digital circuits. Manufacturing failures and transient faults may tamper the functionality. Aut...
152
click to vote
ENTCS
2008
15 years 6 months ago
2008
In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an intruder to dynamically choose and assign names to agents. This capability has b...
174
click to vote
IPL
2006
15 years 6 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
185
click to vote
ISSE
2006
15 years 6 months ago
2006
Providing and managing security for large networked systems is difficult because their size and complexity makes manual design and management nearly impossible. Current security m...