1059 search results - page 83 / 212 » Modeling Security Protocols as Games |
153
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
180
click to vote
IFIP
2010
Springer
15 years 13 days ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
138
click to vote
ESORICS
2006
Springer
15 years 9 months ago
2006
Springer
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, ...
150
Voted
ACSAC
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper concentrates on one particular aspect of providing communication security: rewalls between domains of trust. We argue that signaling support for providing scalable secu...
157
click to vote
CCS
2001
ACM
15 years 10 months ago
2001
ACM
hfulness of Abstract Protocol Analysis: Message Authentication∗ Joshua D. Guttman F. Javier Thayer Lenore D. Zuck December 18, 2002 Dolev and Yao initiated an approach to studyi...