Sciweavers

254 search results - page 10 / 51
» Counting with Population Protocols
Sort
View
69
Voted
DCC
2010
IEEE
14 years 10 months ago
Practical unconditionally secure two-channel message authentication
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...
Atefeh Mashatan, Douglas R. Stinson
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 2 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CN
2010
83views more  CN 2010»
14 years 10 months ago
Secure peer sampling
PuppetCast is a protocol for secure peer sampling in large-scale distributed systems. A peer sampling protocol continuously provides each node in the system with a uniform random ...
Gian Paolo Jesi, Alberto Montresor, Maarten van St...
AINA
2009
IEEE
15 years 5 months ago
Modeling Multiprocessor Cache Protocol Impact on MPI Performance
This paper presents a modeling method particularly suited to analyze interactions between Message Passing Interface MPI library execution and distributed cache coherence protocol....
Ghassan Chehaibar, Meriem Zidouni, Radu Mateescu
100
Voted
IJSNET
2007
91views more  IJSNET 2007»
14 years 10 months ago
SUMP: a secure unicast messaging protocol for wireless ad hoc sensor networks
: Most wireless ad hoc sensor networks are susceptible to routing level attacks, in which an adversary masquerades as a legitimate node to convince neighbouring nodes that it is th...
Jeff Janies, Chin-Tser Huang, Nathan L. Johnson, T...