Sciweavers

1674 search results - page 25 / 335
» On the Optimality of the ARQ-DDF Protocol
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
14 years 13 days ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
JSAC
2006
106views more  JSAC 2006»
13 years 8 months ago
Mathematical Decomposition Techniques for Distributed Cross-Layer Optimization of Data Networks
Abstract--Network performance can be increased if the traditionally separated network layers are jointly optimized. Recently, network utility maximization has emerged as a powerful...
Björn Johansson, Pablo Soldati, Mikael Johans...
AICT
2006
IEEE
122views Communications» more  AICT 2006»
14 years 2 months ago
Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems
A peer-to-peer file sharing system includes a lookup and a content distribution protocol. Very efficient peer-to-peer protocols exist for content distribution, but efficient in...
Anh-Tuan Gai, Laurent Viennot
ESAS
2005
Springer
14 years 2 months ago
SKiMPy: A Simple Key Management Protocol for MANETs in Emergency and Rescue Operations
Mobile ad-hoc networks (MANETs) provide the technical platform for efficient information sharing in emergency and rescue operations. Some the data present on the scene is highly c...
Matija Puzar, Jon Andersson, Thomas Plagemann, Yve...
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
13 years 7 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...