Orchestrating fair exchanges between mutually distrustful web services

Détails

ID Serval
serval:BIB_8D3817BD7E89
Type
Actes de conférence (partie): contribution originale à la littérature scientifique, publiée à l'occasion de conférences scientifiques, dans un ouvrage de compte-rendu (proceedings), ou dans l'édition spéciale d'un journal reconnu (conference proceedings).
Collection
Publications
Titre
Orchestrating fair exchanges between mutually distrustful web services
Titre de la conférence
Proceedings of the 3rd ACM workshop on Secure web services (SWS'06)
Auteur(s)
Garbinato B., Rickebusch I.
Editeur
ACM Press
ISBN
1-59593-546-0
Statut éditorial
Publié
Date de publication
11/2006
Peer-reviewed
Oui
Pages
33-42
Langue
anglais
Résumé
In this paper, we propose a modular and fully decentralized protocol to orchestrate fair exchanges between mutually distrustful yet collaborating web services. Our motivation roots in the observation that fair exchange is a key problem in settings where mutually distrustful entities are willing to exchange critical digital items in the absence of a trusted third party, which is typically the case of web services collaborating on a peer-to-peer basis. Examples of such scenarios include multiparty exchanges of security information (e.g., cryptographic keys), multiparty sharing of digital rights (e.g., to display some digital content), digital contract signing, etc. Our fair exchange orchestration protocol is based on two key building blocks, namely a tamperproof secure box and a module solving the well-known Byzantine agreement problem. The tamperproof secure boxes need not communicate directly with each other and are only required in a limited number of key steps of our algorithm. Our approach has the advantage to allow fair exchanges to complete even though truly malicious participants have aborted.
Mots-clé
dop
Site de l'éditeur
Création de la notice
26/05/2008 11:28
Dernière modification de la notice
03/03/2018 19:15
Données d'usage