Sciweavers

237 search results - page 45 / 48
» Permissive Belief Revision
Sort
View
70
Voted
MOBIHOC
2003
ACM
15 years 9 months ago
Mobility helps security in ad hoc networks
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...
Jean-Pierre Hubaux, Levente Buttyán, Srdjan...
114
Voted
ICS
2009
Tsinghua U.
15 years 2 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
99
Voted
CCS
2008
ACM
15 years 7 days ago
Code injection attacks on harvard-architecture devices
Harvard architecture CPU design is common in the embedded world. Examples of Harvard-based architecture devices are the Mica family of wireless sensors. Mica motes have limited me...
Aurélien Francillon, Claude Castelluccia
94
Voted
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
JAIR
2008
102views more  JAIR 2008»
14 years 10 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang