Sciweavers

2601 search results - page 221 / 521
» Secure Rewarding Schemes
Sort
View
111
Voted
JSAC
2006
127views more  JSAC 2006»
15 years 3 months ago
Location-based compromise-tolerant security mechanisms for wireless sensor networks
Abstract-- Node compromise is a serious threat to wireless sensor networks deployed in unattended and hostile environments. To mitigate the impact of compromised nodes, we propose ...
Yanchao Zhang, Wei Liu, Wenjing Lou, Yuguang Fang
146
Voted
JCM
2007
191views more  JCM 2007»
15 years 3 months ago
Using Antenna Array Redundancy and Channel Diversity for Secure Wireless Transmissions
— The use of signal processing techniques to protect wireless transmissions is proposed as a way to secure wireless networks at the physical layer. This approach addresses a uniq...
Xiaohua Li, Juite Hwu, E. Paul Ratazzi
122
Voted
CORR
2004
Springer
107views Education» more  CORR 2004»
15 years 3 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...
129
Voted
JCIT
2010
131views more  JCIT 2010»
14 years 10 months ago
A Secure Routing Protocol for Peer-to-Peer Network
In peer-to-peer networks, it is very difficult to route query successfully, since nodes in the routing path do not always behave according to pre-established routing protocols. To...
Xu Xiang, Jianguo Chen
139
Voted
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 9 months ago
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda...