Sciweavers

275 search results - page 29 / 55
» The Polling Primitive for Computer Networks
Sort
View
DSN
2006
IEEE
15 years 5 months ago
Randomized Intrusion-Tolerant Asynchronous Services
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
ICALP
2005
Springer
15 years 4 months ago
Append-Only Signatures
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
Eike Kiltz, Anton Mityagin, Saurabh Panjwani, Bara...
ACMSE
2004
ACM
15 years 4 months ago
Implementing the TEA algorithm on sensors
Sensors are tiny computers with limited computational capability and physical resources. The implementation of secure protocols for sensor network is a big challenge. In order to ...
Shuang Liu, Olga V. Gavrylyako, Phillip G. Bradfor...
HPCC
2009
Springer
15 years 2 months ago
Kahn Process Networks are a Flexible Alternative to MapReduce
Experience has shown that development using shared-memory concurrency, the prevalent parallel programming paradigm today, is hard and synchronization primitives nonintuitive becaus...
Zeljko Vrba, Pål Halvorsen, Carsten Griwodz,...
WIOPT
2010
IEEE
14 years 9 months ago
Optimal revocations in ephemeral networks: A game-theoretic framework
—Revocation of public-key certificates is an important security primitive. In this paper, we design a fully distributed local certificate revocation scheme for ephemeral networ...
Igor Bilogrevic, Mohammad Hossein Manshaei, Maxim ...