Sciweavers

310 search results - page 6 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
CCS
2011
ACM
12 years 8 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 7 months ago
Secure Multiparty Computation with Partial Fairness
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
Amos Beimel, Eran Omri, Ilan Orlov
ASIACRYPT
2008
Springer
13 years 10 months ago
Ambiguous Optimistic Fair Exchange
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Su...
IJACT
2008
102views more  IJACT 2008»
13 years 8 months ago
An optimistic fair exchange protocol and its security in the universal composability framework
: Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimi...
Yusuke Okada, Yoshifumi Manabe, Tatsuaki Okamoto
IPPS
2005
IEEE
14 years 2 months ago
ExchangeGuard: A Distributed Protocol for Electronic Fair-Exchange
1 Electronic fair-exchange protocols have received significant attention from the research community in the recent past. In loose terms, the fair exchange problem is defined as at...
Mudhakar Srivatsa, Li Xiong, Ling Liu