1853 search results - page 139 / 371 » Cryptographic Protocols and Network Security |
161
Voted
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
124
click to vote
SAINT
2007
IEEE
15 years 10 months ago
2007
IEEE
– The rapid growth of IP-based mobile telecommunication technologies in the past few years has revealed situations where not only a single node but an entire network moves and ch...
185
Voted
FORTE
2009
15 years 2 months ago
2009
We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the secur...
135
click to vote
PET
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Webs of trust constitute a decentralized infrastructure for establishing the authenticity of the binding between public keys and users and, more generally, trust relation...
119
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
To protect against replay attacks, many Internet protocols rely on nonces to guarantee freshness. In practice, the server generates these nonces during the initial handshake, but ...