Sciweavers

3115 search results - page 131 / 623
» Synthesizing Secure Protocols
Sort
View
127
Voted
ENTCS
2006
173views more  ENTCS 2006»
15 years 3 months ago
Formal Security Analysis for Ad-Hoc Networks
In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can p...
Sebastian Nanz, Chris Hankin
173
Voted
ENTCS
2008
390views more  ENTCS 2008»
15 years 2 months ago
Cryptographic Versus Trust-based Methods for MANET Routing Security
Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues ...
Jared Cordasco, Susanne Wetzel
112
Voted
ACSAC
2006
IEEE
15 years 9 months ago
Secure Distributed Cluster Formation in Wireless Sensor Networks
In wireless sensor networks, clustering sensor nodes into small groups is an effective technique to achieve scalability, self-organization, power saving, channel access, routing, ...
Kun Sun, Pai Peng, Peng Ning, Cliff Wang
134
Voted
FC
2010
Springer
196views Cryptology» more  FC 2010»
15 years 7 months ago
Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...
Jorge Guajardo, Bart Mennink, Berry Schoenmakers
165
Voted
CCS
2008
ACM
15 years 5 months ago
Towards provable secure neighbor discovery in wireless networks
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
Marcin Poturalski, Panagiotis Papadimitratos, Jean...