31 search results - page 1 / 7 » Efficient Rational Secret Sharing in Standard Communication ... |
TCC
2010
Springer
15 years 6 months ago
2010
Springer
TCC
2009
Springer
15 years 10 months ago
2009
Springer
We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a s...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating...
106
click to vote
NETWORKING
2004
14 years 11 months ago
2004
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...