2601 search results - page 286 / 521 » Secure Rewarding Schemes |
167
click to vote
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
135
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—In lightweight mobile ad hoc networks, both probabilistic and deterministic key management schemes are fragile to node fabrication attacks. Our simulation results show t...
115
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—The demand for efficient data dissemination/access techniques to find the relevant data from within a sensor network has led to the development of data-centric sensor networks...
138
click to vote
ADHOCNOW
2005
Springer
15 years 9 months ago
2005
Springer
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
137
click to vote
WMASH
2004
ACM
15 years 9 months ago
2004
ACM
In recent years, wireless Internet service providers (WISPs) have established thousands of WiFi hot spots in cafes, hotels and airports in order to offer to travelling Internet u...