239 search results - page 41 / 48 » Approaches to Formal Verification of Security Protocols |
112
click to vote
SASO
2007
IEEE
15 years 3 months ago
2007
IEEE
A fundamental problem that confronts decentralized reputation systems is the design of efficient, secure and incentive-compatible mechanisms to gather trust information despite m...
189
click to vote
POPL
2006
ACM
15 years 9 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
ASE
2002
14 years 9 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
DIM
2005
ACM
14 years 11 months ago
2005
ACM
We develop solutions for the security and privacy of user identity information in a federation. By federation we mean a group of organizations or service providers which have buil...
RTA
2009
Springer
15 years 4 months ago
2009
Springer
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...