Publication
In contrast with traditional cryptographic protocols in which parties can have access to common third parties, and where at least one of them is assumed to be honest, we propose here a new model which is relevant for networks of communication devices with security modules. We then focus on the problem of fair exchange in this model. We propose a probabilistic protocol which provides arbitrarily low unfairness (involving a complexity cost).
Serge Vaudenay, Bénédikt Minh Dang Tran
Boi Faltings, Sujit Prakash Gujar, Aleksei Triastcyn, Sankarshan Damle