Sciweavers

310 search results - page 8 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
WPES
2003
ACM
14 years 1 months ago
Leveraging the "Multi" in secure multi-party computation
Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in s...
Jaideep Vaidya, Chris Clifton
ECRA
2007
113views more  ECRA 2007»
13 years 8 months ago
Exclusions and related trust relationships in multi-party fair exchange protocols
Some electronic commerce transactions are inherently performed between more than two parties. In this context, it is thus important to determine whether the underlying fair exchan...
Nicolás González-Deleito, Olivier Ma...
ESORICS
2010
Springer
13 years 9 months ago
Optimistic Fair Exchange with Multiple Arbiters
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
Alptekin Küpçü, Anna Lysyanskaya
TCOS
2010
13 years 3 months ago
J-PAKE: Authenticated Key Exchange without PKI
Password Authenticated Key Exchange (PAKE) is one of the important topics in cryptography. It aims to address a practical security problem: how to establish secure communication be...
Feng Hao, Peter Ryan
DRM
2003
Springer
14 years 1 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin