Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,300
On expected constant-round protocols for Byzantine agreement
- In Advances in Cryptology — Crypto ’06
, 2006
"... In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t < n/3 malicious parties and runs in expected constant rounds. Here, resolving a question that had been open since their work, we show an expected constant-round protocol for aut ..."
Abstract
-
Cited by 24 (5 self)
- Add to MetaCart
In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t < n/3 malicious parties and runs in expected constant rounds. Here, resolving a question that had been open since their work, we show an expected constant-round protocol
Improved Single-Round Protocols for Remote File Synchronization
- in Proc. of the 24th Conference of the IEEE Communications Society (INFOCOM
"... Abstract—Given two versions of a file, a current version located on one machine and an outdated version known only to another machine, the remote file synchronization prob-lem is how to update the outdated version over a network with a minimal amount of communication. In particular, when the version ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
protocols, there are many scenar-ios where multiple rounds are undesirable. In this paper, we study single-round protocols for file synchronization that offer significant improvements over rsync. Our main contribution is a new approach to file syn-chronization based on the use of erasure codes. Using
Two 1-Round Protocols for Delegation of Computation
, 2011
"... Consider a weak client that wishes to delegate computation to an untrusted server and be able to succinctly verify the correctness of the result, all within one round of interaction. We provide solutions for two relaxed variants of this problem. Specifically: • We consider a model where the client d ..."
Abstract
- Add to MetaCart
delegates the computation to two or more servers, and is guaranteed to output the correct answer as long as even a single server is honest. We call this model Refereed Delegation of Computation (RDoC). In this model, we show a 1-round unconditionally statistically sound protocol for any log-space uniform N
One-Round Protocols for Two-Party Authenticated Key Exchange
- ACNS
, 2004
"... Abstract. Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channel). In particular, most protocols for two-party key exchange have been designed assuming that parties alternate ..."
Abstract
-
Cited by 41 (2 self)
- Add to MetaCart
-secure protocols for two-party authenticated key exchange (AKE) which require only a single round. Our first protocol provides key independence only, and is analyzed in the random oracle model. This scheme matches the most efficient AKE protocols among those found in the literature. Our second scheme additionally
One-Round Protocols for Two-Party Authenticated Key Exchange
, 2008
"... Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channel). In particular, most protocols for two-party key exchange have been designed assuming that parties alternate sending t ..."
Abstract
- Add to MetaCart
-party authenticated key exchange (AKE) which require only a single round. Our first, most efficient protocol provides key independence but not forward secrecy. Our second scheme additionally provides forward secrecy but requires some additional computation. Security of these two protocols is analyzed in the random
Bits About the Channel: Multi-round Protocols for Two-way Fading Channels
- In Preparation. May 19, 2009 DRAFT
"... Most communication systems use some form of feedback, often related to channel state information. In this paper, we study diversity multiplexing tradeoff for both FDD and TDD systems, when both receiver and transmitter knowledge about the channel is noisy and potentially mismatched. For FDD systems, ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
, we first extend the achievable tradeoff region for 1.5 rounds of message passing to get higher diversity compared to the best known scheme, in the regime of higher multiplexing gains. We then break the mold of all current channel state based protocols by using multiple rounds of conferencing
Equation-based congestion control for unicast applications
- SIGCOMM '00
, 2000
"... This paper proposes a mechanism for equation-based congestion control for unicast traffic. Most best-effort traffic in the current Internet is well-served by the dominant transport protocol, TCP. However, traffic such as best-effort unicast streaming multimedia could find use for a TCP-friendly cong ..."
Abstract
-
Cited by 830 (29 self)
- Add to MetaCart
This paper proposes a mechanism for equation-based congestion control for unicast traffic. Most best-effort traffic in the current Internet is well-served by the dominant transport protocol, TCP. However, traffic such as best-effort unicast streaming multimedia could find use for a TCP
Random Early Detection Gateways for Congestion Avoidance.
- IEEELACM Transactions on Networking,
, 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract
-
Cited by 2716 (31 self)
- Add to MetaCart
-layer congestion control protocol such as TCP. The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways. lNTRODucTION I N high
The Performance of TCP/IP for Networks with High Bandwidth-Delay Products and Random Loss.
- IEEE/ACM Trans. Networking,
, 1997
"... Abstract-This paper examines the performance of TCP/IP, the Internet data transport protocol, over wide-area networks (WANs) in which data traffic could coexist with real-time traffic such as voice and video. Specifically, we attempt to develop a basic understanding, using analysis and simulation, ..."
Abstract
-
Cited by 465 (6 self)
- Add to MetaCart
Abstract-This paper examines the performance of TCP/IP, the Internet data transport protocol, over wide-area networks (WANs) in which data traffic could coexist with real-time traffic such as voice and video. Specifically, we attempt to develop a basic understanding, using analysis and simulation
Congestion control for high bandwidth-delay product networks
- SIGCOMM '02
, 2002
"... Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to incorporate very high-bandwidth optical links and mo ..."
Abstract
-
Cited by 454 (4 self)
- Add to MetaCart
and more large-delay satellite links. To address this problem, we develop a novel approach to Internet congestion control that outperforms TCP in conventional environments, and remains efficient, fair, scalable, and stable as the bandwidth-delay product increases. This new eXplicit Control Protocol, XCP
Results 1 - 10
of
2,300
