Sciweavers

1432 search results - page 218 / 287
» Hardness of robust network design
Sort
View
FOCS
2009
IEEE
16 years 27 days ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
TGC
2007
Springer
16 years 8 days ago
A Protocol Compiler for Secure Sessions in ML
Distributed applications can be structured using sessions that specify flows of messages between roles. We design a small specific language to declare sessions. We then build a c...
Ricardo Corin, Pierre-Malo Deniélou
IWCMC
2006
ACM
16 years 3 days ago
Voice capacity under quality constraints for IEEE 802.11a based WLANs
The communication of voice over wireless local area networks (WLANs) is influenced by the choice of speech codec, packetization interval and PHY layer bit rates. These choices a...
Niranjan Shetty, Sayantan Choudhury, Jerry D. Gibs...
IWCMC
2006
ACM
16 years 3 days ago
Effect of payload length variation and retransmissions on multimedia in 802.11a WLANs
Multimedia transmission over wireless local area networks is challenging due to the varying nature of the wireless channel as well as the inherent difference between multimedia a...
Sayantan Choudhury, Irfan Sheriff, Jerry D. Gibson...
CCS
2008
ACM
15 years 8 months ago
A general model of probabilistic packet marking for IP traceback
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
Liming Lu, Mun Choon Chan, Ee-Chien Chang