Sciweavers

54 search results - page 9 / 11
» Lower Bounds for the Noisy Broadcast Problem
Sort
View
EUROCRYPT
1999
Springer
13 years 11 months ago
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
Ivan Damgård, Joe Kilian, Louis Salvail
TSP
2010
13 years 2 months ago
Optimal/near-optimal dimensionality reduction for distributed estimation in homogeneous and certain inhomogeneous scenarios
We consider distributed estimation of a deterministic vector parameter from noisy sensor observations in a wireless sensor network (WSN). The observation noise is assumed uncorrela...
Jun Fang, Hongbin Li
SOFSEM
1997
Springer
13 years 11 months ago
Path Layout in ATM Networks
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
Shmuel Zaks
ICASSP
2011
IEEE
12 years 11 months ago
Secrecy capacity and secure outage performance for rayleigh fading simo channel
In this paper, we consider the problem of secret communication through Rayleigh fading single-input multiple-output (SIMO) broadcast channel in the presence of an eavesdropper. At...
Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah
ICASSP
2009
IEEE
14 years 2 months ago
Semi-definite programming approach to sensor network node localization with anchor position uncertainty
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
Kenneth Wing-Kin Lui, Wing-Kin Ma, Hing-Cheung So,...