Sciweavers

310 search results - page 19 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
68
Voted
ICNP
1996
IEEE
15 years 1 months ago
Time-Shift Scheduling: Fair Scheduling of Flows in High Speed Networks
Abstract-- We present a scheduling protocol, called TimeShift Scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a p...
Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas
CCS
2010
ACM
14 years 9 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
CRYPTO
2006
Springer
149views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
15 years 10 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
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
14 years 11 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh