Sciweavers

145 search results - page 12 / 29
» Secure Two-Party Computation with Low Communication
Sort
View
PODC
2009
ACM
14 years 9 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
ANCS
2008
ACM
13 years 10 months ago
Low power architecture for high speed packet classification
Today's routers need to perform packet classification at wire speed in order to provide critical services such as traffic billing, priority routing and blocking unwanted Inte...
Alan Kennedy, Xiaojun Wang, Zhen Liu, Bin Liu
TMC
2012
11 years 11 months ago
Secure Initialization of Multiple Constrained Wireless Devices for an Unaided User
—A number of protocols and mechanisms have been proposed to address the problem of initial secure key deployment in wireless networks. Most existing approaches work either with a...
Toni Perkovic, Mario Cagalj, Toni Mastelic, Nitesh...
APNOMS
2006
Springer
14 years 15 days ago
Security Approaches for Cluster Interconnection in a Wireless Sensor Network
Abstract. A wireless sensor network is a collection of devices limited in lowpowered batteries, processing, communication bandwidth capabilities and low memory availability. Due to...
Alexandre Gava Menezes, Carlos Becker Westphall
WISEC
2009
ACM
14 years 3 months ago
An attacker model for MANET routing security
Mobile ad-hoc networks are becoming ever more popular due to their flexibility, low cost, and ease of deployment. However, to achieve these benefits the network must employ a so...
Jared Cordasco, Susanne Wetzel