719 search results - page 84 / 144 » Proving Security Protocols Correct |
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
124
click to vote
ADHOCNOW
2004
Springer
15 years 3 months ago
2004
Springer
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...
100
click to vote
ISCI
2008
14 years 9 months ago
2008
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later bee...