Sciweavers

525 search results - page 8 / 105
» A Fair e-Tendering Protocol
Sort
View
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
14 years 8 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
DRM
2003
Springer
14 years 23 days ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
TON
1998
77views more  TON 1998»
13 years 7 months ago
Time-shift scheduling - fair scheduling of flows in high-speed networks
—We present a scheduling protocol, called time-shift scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a predet...
Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas
NCA
2003
IEEE
14 years 25 days ago
A Truthful Mechanism for Fair Load Balancing in Distributed Systems
In this paper we consider the problem of designing load balancing protocols in distributed systems where the participants (e.g. computers, users) are capable of manipulating the l...
Daniel Grosu, Anthony T. Chronopoulos
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 6 months ago
Secure Multiparty Computation with Partial Fairness
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
Amos Beimel, Eran Omri, Ilan Orlov