Sciweavers

133 search results - page 7 / 27
» On the security of linear consensus networks
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 8 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
SASN
2006
ACM
14 years 1 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
TIT
2011
144views more  TIT 2011»
13 years 2 months ago
Network Generalized Hamming Weight
— In this paper, we extend the notion of generalized Hamming weight for classical linear block code to linear network codes by introducing the network generalized Hamming weight ...
Chi Kin Ngai, Raymond W. Yeung, Zhen Zhang
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Security for Wiretap Networks via Rank-Metric Codes
The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver n packets from s...
Danilo Silva, Frank R. Kschischang
CSFW
2008
IEEE
14 years 2 months ago
Security Decision-Making among Interdependent Organizations
In various settings, such as when customers use the same passwords at several independent web sites, security decisions by one organization may have a significant impact on the s...
Reiko Ann Miura-Ko, Benjamin Yolken, John Mitchell...