Sciweavers

679 search results - page 64 / 136
» Using decision problems in public key cryptography
Sort
View
WCNC
2008
IEEE
15 years 7 months ago
A Secure Routing Protocol in Proactive Security Approach for Mobile Ad-Hoc Networks
—Secure routing of Mobile Ad-hoc Networks (MANETs) is still a hard problem after years of research. We therefore propose to design a secure routing protocol in a new approach. Th...
Shushan Zhao, Akshai K. Aggarwal, Shuping Liu, Hua...
CIKM
2009
Springer
15 years 8 months ago
Learning to rank from Bayesian decision inference
Ranking is a key problem in many information retrieval (IR) applications, such as document retrieval and collaborative filtering. In this paper, we address the issue of learning ...
Jen-Wei Kuo, Pu-Jen Cheng, Hsin-Min Wang
MOBIHOC
2007
ACM
16 years 29 days ago
Containing denial-of-service attacks in broadcast authentication in sensor networks
Broadcast authentication is an important application in sensor networks. Public Key Cryptography (PKC) is desirable for this application, but due to the resource constraints on se...
Ronghua Wang, Wenliang Du, Peng Ning
ITCC
2005
IEEE
15 years 7 months ago
CompChall: Addressing Password Guessing Attacks
Even though passwords are the most convenient means of authentication, they bring along themselves the threat of dictionary attacks. Dictionary attacks may be of two kinds: online...
Vipul Goyal, Virendra Kumar, Mayank Singh, Ajith A...
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
15 years 5 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski