5891 search results - page 211 / 1179 » On the Computational Security of a Distributed Key Distribut... |
139
click to vote
ICDCS
2000
IEEE
15 years 9 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
130
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
150
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
—To harness the ever growing capacity and decreasing cost of storage, providing an abstraction of dependable storage in the presence of crash-stop and Byzantine failures is compu...
150
click to vote
EDCC
2005
Springer
15 years 10 months ago
2005
Springer
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security mo...
155
click to vote
EUROCRYPT
2003
Springer
15 years 10 months ago
2003
Springer
A variant of Schnorr’s signature scheme called RDSA has been proposed by I. Biehl, J. Buchmann, S. Hamdy and A. Meyer in order to be used in finite abelian groups of unknown ord...