1513 search results - page 215 / 303 » Cryptographic Pattern Matching |
MOBIHOC
2003
ACM
14 years 9 months ago
2003
ACM
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We...
FSTTCS
2003
Springer
14 years 3 months ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
STOC
2000
ACM
14 years 2 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
AICT
2008
IEEE
13 years 10 months ago
2008
IEEE
This paper presents the simplified method of random test suite based on the frequency (block) test. The test is used to check the first property of random numbers which is to have ...
IJNSEC
2006
13 years 10 months ago
2006
Mobile ad-hoc wireless networks are established in improvised environments through the mutual cooperation of its participating nodes. These nodes often operate in a physically ins...