Sciweavers

422 search results - page 11 / 85
» Protocol Specialization
Sort
View
SAC
2009
ACM
15 years 6 months ago
Opportunistic real-time routing in multi-hop wireless sensor networks
Wireless sensor networks (WSNs) are subject to significant resource constraints. Particularly, routing protocols for lowrate WSNs suffer from maintaining routing metrics and sta...
Junwhan Kim, Binoy Ravindran
ASIACRYPT
1999
Springer
15 years 6 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
CN
2006
117views more  CN 2006»
15 years 1 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
131
Voted
MOBICOM
1999
ACM
15 years 6 months ago
Scenario-Based Performance Analysis of Routing Protocols for Mobile ad-hoc Networks
This study is a comparison of three routing protocols proposed for wireless mobile ad-hoc networks. The protocols are: Destination Sequenced Distance Vector (DSDV), Ad-hoc On dema...
Per Johansson, Tony Larsson, Nicklas Hedman, Barto...
PODC
1993
ACM
15 years 6 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld