22 search results - page 4 / 5 » Using ProVerif to Analyze Protocols with Diffie-Hellman Expo... |
CADE
2008
Springer
14 years 11 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
FC
2008
Springer
14 years 18 days ago
2008
Springer
We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unl...
LCN
1994
IEEE
14 years 3 months ago
1994
IEEE
We analyze the behavior of the Ethernet in networks with a small number of active stations, and describe what is known as the Ethernet capture effect, where a station transmits co...
PODC
2009
ACM
14 years 11 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
MOBIHOC
2009
ACM
14 years 11 months ago
2009
ACM
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...