Papers published on a yearly basis
Papers
More filters
••
TL;DR: This work asks what is possible in the information-theoretic setting when the adversary is very strong and the network connectivity is very low (minimum needed for crash-tolerance), and shows a sizable gap between the connectivity required for perfect security and for almost perfect security.
Abstract: Problems of secure communication and computation have been studied extensively in network models. In this work we ask what is possible in the information-theoretic setting when the adversary is very strong (Byzantine) and the network connectivity is very low (minimum needed for crash-tolerance). We concentrate on a new model called ``multicast lines,'' and show a sizable gap between the connectivity required for perfect security and for almost perfect security. Our results also have implications to the commonly studied simple channel model and to general secure multiparty computation.
166 citations
••
11 Aug 2006
TL;DR: This work conducts extensive measurement that involves both controlled routing updates through two tier-1 ISPs and active probes of a diverse set of end-to-end paths on the Internet and finds that routing changes contribute to end- to-end packet loss significantly.
Abstract: Extensive measurement studies have shown that end-to-end Internet path performance degradation is correlated with routing dynamics. However, the root cause of the correlation between routing dynamics and such performance degradation is poorly understood. In particular, how do routing changes result in degraded end-to-end path performance in the first place? How do factors such as topological properties, routing policies, and iBGP configurations affect the extent to which such routing events can cause performance degradation? Answers to these questions are critical for improving network performance.In this paper, we conduct extensive measurement that involves both controlled routing updates through two tier-1 ISPs and active probes of a diverse set of end-to-end paths on the Internet. We find that routing changes contribute to end-to-end packet loss significantly. Specifically, we study failover events in which a link failure leads to a routing change and recovery events in which a link repair causes a routing change. In both cases, it is possible to experience data plane performance degradation in terms of increased long loss burst as well as forwarding loops. Furthermore, we find that common routing policies and iBGP configurations of ISPs can directly affect the end-to-end path performance during routing changes. Our work provides new insights into potential measures that network operators can undertake to enhance network performance.
166 citations
••
TL;DR: It is shown that by introducing multiple cascaded feed-forward carrier recovery stages, the required compute power can be significantly reduced compared to the prior art using the single-stage-based blind phase search method.
Abstract: An improved feed-forward carrier phase recovery method is proposed for coherent receivers using M-ary quadrature amplitude modulation-based modulation formats. It is shown that by introducing multiple cascaded feed-forward carrier recovery stages, the required compute power can be significantly reduced compared to the prior art using the single-stage-based blind phase search method.
166 citations
••
06 Jul 1999TL;DR: A new boosting algorithm is proposed that is an adaptive version of the boost by majority algorithm and combines bounded goals of the boosted algorithm with the adaptivity of AdaBoost.
Abstract: We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorithm with the adaptivity of AdaBoost.
166 citations
••
20 Apr 2009TL;DR: This analysis tackles numerous challenges posed by modern web applications including asynchronous communication, frameworks, and dynamic code generation, and builds an intrusion-prevention proxy for the server that intercepts client requests and disables those that do not meet the expected behavior.
Abstract: We present a static control-flow analysis for JavaScript programs running in a web browser. Our analysis tackles numerous challenges posed by modern web applications including asynchronous communication, frameworks, and dynamic code generation. We use our analysis to extract a model of expected client behavior as seen from the server, and build an intrusion-prevention proxy for the server: the proxy intercepts client requests and disables those that do not meet the expected behavior. We insert random asynchronous requests to foil mimicry attacks. Finally, we evaluate our technique against several real applications and show that it protects against an attack in a widely-used web application.
166 citations
Authors
Showing all 1881 results
Name | H-index | Papers | Citations |
---|---|---|---|
Yoshua Bengio | 202 | 1033 | 420313 |
Scott Shenker | 150 | 454 | 118017 |
Paul Shala Henry | 137 | 318 | 35971 |
Peter Stone | 130 | 1229 | 79713 |
Yann LeCun | 121 | 369 | 171211 |
Louis E. Brus | 113 | 347 | 63052 |
Jennifer Rexford | 102 | 394 | 45277 |
Andreas F. Molisch | 96 | 777 | 47530 |
Vern Paxson | 93 | 267 | 48382 |
Lorrie Faith Cranor | 92 | 326 | 28728 |
Ward Whitt | 89 | 424 | 29938 |
Lawrence R. Rabiner | 88 | 378 | 70445 |
Thomas E. Graedel | 86 | 348 | 27860 |
William W. Cohen | 85 | 384 | 31495 |
Michael K. Reiter | 84 | 380 | 30267 |