Sciweavers

106 search results - page 5 / 22
» Optimistic Fair Secure Computation
Sort
View
PODC
1998
ACM
14 years 1 months ago
Optimal Efficiency of Optimistic Contract Signing
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
Birgit Pfitzmann, Matthias Schunter, Michael Waidn...
CTRSA
2008
Springer
197views Cryptology» more  CTRSA 2008»
13 years 11 months ago
Legally-Enforceable Fairness in Secure Two-Party Computation
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should...
Andrew Y. Lindell
IJNSEC
2008
190views more  IJNSEC 2008»
13 years 9 months ago
Probabilistic Analysis and Verification of the ASW Protocol using PRISM
The ASW protocol is one of the prominent optimistic fair exchange protocols that is used for contract signing between two participants, the originator and the responder, with the ...
Salekul Islam, Mohammad Abu Zaid
EUROCRYPT
2010
Springer
14 years 2 months ago
Partial Fairness in Secure Two-Party Computation
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
S. Dov Gordon, Jonathan Katz
EUROCRYPT
2003
Springer
14 years 3 months ago
Fair Secure Two-Party Computation
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...
Benny Pinkas