404 search results - page 10 / 81 » Robust Multiparty Computation with Linear Communication Comp... |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
TCOM
2010
13 years 2 months ago
2010
In this letter we propose linear non-regenerative multicarrier multiple-input multiple-output (MIMO) relay technique that aims to minimize the mean-squared error (MSE) of the signa...