Sciweavers

72 search results - page 10 / 15
» A Provably Secure and Efficient Countermeasure against Timin...
Sort
View
86
Voted
WS
2003
ACM
15 years 2 months ago
Rushing attacks and defense in wireless ad hoc network routing protocols
In an ad hoc network, mobile computers (or nodes) cooperate to forward packets for each other, allowing nodes to communicate beyond their direct wireless transmission range. Many ...
Yih-Chun Hu, Adrian Perrig, David B. Johnson
PEWASUN
2004
ACM
15 years 2 months ago
A framework of secure location service for position-based ad hoc routing
In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location i...
Joo-Han Song, Vincent W. S. Wong, Victor C. M. Leu...
CCS
2007
ACM
15 years 3 months ago
A k-anonymous communication protocol for overlay networks
Anonymity is increasingly important for network applications concerning about censorship and privacy. The existing anonymous communication protocols generally stem from mixnet and...
Pan Wang, Peng Ning, Douglas S. Reeves
IJNSEC
2006
132views more  IJNSEC 2006»
14 years 9 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
Sahadeo Padhye, Birendra Kumar Sharma
80
Voted
GLVLSI
2007
IEEE
107views VLSI» more  GLVLSI 2007»
15 years 3 months ago
Side-channel resistant system-level design flow for public-key cryptography
In this paper, we propose a new design methodology to assess the risk for side-channel attacks, more specifically timing analysis and simple power analysis, at an early design st...
Kazuo Sakiyama, Elke De Mulder, Bart Preneel, Ingr...