Sciweavers

1769 search results - page 154 / 354
» Cryptography
Sort
View
130
Voted
IJNSEC
2011
128views more  IJNSEC 2011»
14 years 10 months ago
Certificateless Group Oriented Signature Secure Against Key Replacement Attack
Since Al-Riyami and Paterson presented certificateless cryptography, many certificateless schemes have been proposed for different purposes. In this paper, we present a certificate...
Chunbo Ma, Jun Ao
115
Voted
IACR
2011
91views more  IACR 2011»
14 years 3 months ago
Improved Generalized Birthday Attack
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
Paul Kirchner
154
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
139
Voted
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
16 years 21 days ago
Structure and Dynamics of Research Collaboration in Computer Science.
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods, developed in physics and social sciences, have been s...
Andre Nash, Christian Bird, Earl T. Barr, Premkuma...
146
Voted
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 9 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma