Sciweavers

359 search results - page 2 / 72
» On Complete Primitives for Fairness
Sort
View
OPODIS
2000
13 years 7 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...
PODC
2004
ACM
13 years 11 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 ...
ENTCS
2000
74views more  ENTCS 2000»
13 years 5 months ago
Categorical Models for Fairness: Completion vs Delay
Thomas T. Hildebrandt
FC
2008
Springer
94views Cryptology» more  FC 2008»
13 years 7 months ago
Fair Traceable Multi-Group Signatures
This paper presents fair traceable multi-group signatures (FTMGS), which have enhanced capabilities, compared to group and traceable signatures, that are important in real world sc...
Vicente Benjumea, Seung Geol Choi, Javier Lopez, M...
JHSN
2000
86views more  JHSN 2000»
13 years 5 months ago
Alert communication primitives above TCP
We consider communication primitives that can be executed by an application process to exchange messages with another application process over a TCP/IP network. A communication pri...
Mohamed G. Gouda, Tommy M. McGuire