Sciweavers

310 search results - page 14 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
PODC
2010
ACM
15 years 10 months ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer
NOSSDAV
2009
Springer
16 years 17 days ago
Probabilistic event resolution with the pairwise random protocol
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
John L. Miller, Jon Crowcroft
EUROCRYPT
2004
Springer
15 years 11 months ago
Public-Key Steganography
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
Luis von Ahn, Nicholas J. Hopper
XMLSEC
2003
ACM
15 years 11 months ago
Optimistic fair contract signing for Web services
Reliable and atomic transactions are a key to successful eBusiness interactions. Reliable messaging subsystems, such as IBM’s MQ Series, or broker-based techniques have been tra...
Hiroshi Maruyama, Taiga Nakamura, Tony Hsieh
NDSS
2000
IEEE
15 years 10 months ago
Analysis of a Fair Exchange Protocol
We analyze an optimistic contract signing protocol of Asokan, Shoup, and Waidner as a case study in the applicability of formal methods to verification of fair exchange protocols...
Vitaly Shmatikov, John C. Mitchell