Sciweavers

361 search results - page 50 / 73
» Composition of Password-Based Protocols
Sort
View
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 8 months ago
Universal Loop-Free Super-Stabilization
Abstract. We propose an univesal scheme to design loop-free and superstabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isom...
Lélia Blin, Maria Potop-Butucaru, Stephane ...
ICC
2009
IEEE
111views Communications» more  ICC 2009»
13 years 6 months ago
On the Capacity of Bidirectional Broadcast Channels under Channel Uncertainty
We consider the broadcast phase of a spectrally efficient two-phase decode-and-forward protocol which is used by a relay node to establish a bidirectional communication between two...
Rafael F. Wyrembelski, Igor Bjelakovic, Tobias J. ...
JSC
2010
100views more  JSC 2010»
13 years 3 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
FOCS
2003
IEEE
14 years 2 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
EUROCRYPT
2007
Springer
14 years 18 days ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo