The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
We consider a MIMO fading broadcast channel and compute achievable ergodic rates when channel state information is acquired at the receivers via downlink training and explicit cha...
Giuseppe Caire, Nihar Jindal, Mari Kobayashi, Nira...
In this paper we present an evaluation of techniques that are designed to encourage web searchers to interact more with the results of a web search. Two specific techniques are ex...
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
This paper discusses some issues related to the planning of a series of grid experiments in the context of the TrebleCLEF project with the aim of improving the comprehension of Mul...