Secure Multiparty Computation vs. Fair Exchange - Bridging the Gap

Conference object English OPEN
Garbinato , Benoît; Rickebusch , Ian;
(2013)
  • Publisher: Matthieu Roy
  • Subject: Safety | Embedded systems | [ INFO.INFO-ES ] Computer Science [cs]/Embedded Systems

International audience; In this paper, we propose a comparison of fair exchange and secure multiparty computation. Despite their apparent similarity, these two problems arise respectively from the elds of distributed systems and of modern cryptography. The wide di erenc... View more
  • References (33)
    33 references, page 1 of 4

    1. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Area in Communications, 18:593{610, 2000.

    2. G. Ateniese. E cient veri able encryption (and fair exchange) of digital signatures. In CCS '99: Proceedings of the 6th ACM conference on Computer and communications security, pages 138{146, New York, NY, USA, 1999. ACM Press.

    3. G. Avoine, F. Gartner, R. Guerraoui, K. Kursawe, S. Vaudenay, and M. Vukolic. Reducing fair exchange to atomic commit. Technical report, Swiss Federal Institute of Technology (EPFL), 2004.

    4. G. Avoine, F. Gartner, R. Guerraoui, and M. Vukolic. Gracefully degrading fair exchange with security modules (extended abstract). In In Proceedings of the 5th European Dependable Computing Conference - EDCC 2005, 2005.

    5. G. Avoine and S. Vaudenay. Fair exchange with guardian angels. In Proceedings of the 4th International Workshop on Information Security Applications (WISA), volume LNCS. Springer, 2003.

    6. B. Baum-Waidner and M. Waidner. Round-optimal and abuse free optimistic multi-party contract signing. In Automata, Languages and Programming, number 1853 in Lecture Notes in Computer Science (LNCS), pages 524{535. Springer, 2000.

    7. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 1{10, New York, NY, USA, 1988. ACM Press.

    8. Z. Benenson, F. Gartner, and D. Kesdogan. Secure multi-party computation with security modules. Technical report, RWTH Aachen University of Technology, 2004.

    9. H. Burk and A. P tzmann. Value exchange systems enabling security and unobservability. Computers & Security, 9(9):715{721, 1990.

    10. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 13(1):143{202, 2000.

  • Metrics
Share - Bookmark