Sciweavers

278 search results - page 53 / 56
» Variants of Spreading Messages
Sort
View
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
13 years 11 months ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
ASIACRYPT
2008
Springer
13 years 9 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger
ADHOC
2006
116views more  ADHOC 2006»
13 years 7 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
JCST
2008
120views more  JCST 2008»
13 years 7 months ago
Generic Transformation from Weakly to Strongly Unforgeable Signatures
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed...
Qiong Huang, Duncan S. Wong, Jin Li, Yiming Zhao
JCS
2006
157views more  JCS 2006»
13 years 7 months ago
Analysis of probabilistic contract signing
We present three case studies, investigating the use of probabilistic model checking to automatically analyse properties of probabilistic contract signing protocols. We use the pr...
Gethin Norman, Vitaly Shmatikov