Sciweavers

529 search results - page 19 / 106
» A Fair Non-repudiation Protocol
Sort
View
PODC
2004
ACM
14 years 1 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
OPODIS
2000
13 years 9 months ago
Fair and Reliable Self-stabilizing Communication
We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The paper present...
Ivan Lavallée, Christian Lavault, Colette J...
SIGCOMM
1999
ACM
13 years 12 months ago
The Impact of Multicast Layering on Network Fairness
Many de nitions of fairness for multicast networks assume that sessions are single-rate, requiring that each multicast session transmits data to all of its receivers at the same r...
Dan Rubenstein, James F. Kurose, Donald F. Towsley
SP
2007
IEEE
120views Security Privacy» more  SP 2007»
14 years 1 months ago
Endorsed E-Cash
An electronic cash (e-cash) scheme lets a user withdraw money from a bank and then spend it anonymously. E-cash can be used only if it can be securely and fairly exchanged for ele...
Jan Camenisch, Anna Lysyanskaya, Mira Meyerovich
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 8 months ago
Complete Fairness in Multi-party Computation without an Honest Majority
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
S. Dov Gordon, Jonathan Katz