Sciweavers

31 search results - page 1 / 7
» Efficient Rational Secret Sharing in Standard Communication ...
Sort
View
TCC
2010
Springer
303views Cryptology» more  TCC 2010»
14 years 1 months ago
Efficient Rational Secret Sharing in Standard Communication Networks
Georg Fuchsbauer, Jonathan Katz, David Naccache
TCC
2009
Springer
154views Cryptology» more  TCC 2009»
14 years 5 months ago
Fairness with an Honest Minority and a Rational Majority
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...
Shien Jin Ong, David C. Parkes, Alon Rosen, Salil ...
ICC
2007
IEEE
186views Communications» more  ICC 2007»
13 years 11 months ago
An Efficient Cluster-Based Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks
– 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...
Ying Dong, Ai Fen Sui, Siu-Ming Yiu, Victor O. K. ...
MOBIHOC
2009
ACM
14 years 5 months ago
Efficient uncoordinated FHSS anti-jamming communication
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...
Mario Strasser, Christina Pöpper, Srdjan Capk...
NETWORKING
2004
13 years 6 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
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 ...
Li Zhou, Chinya V. Ravishankar