In this paper we present techniques by which each mix in a mix network can be paid for its services by message senders, in a way that ensures fairness and without sacrificing anonymity. We describe a payment mechanism for use in mix networks, and use this payment scheme in fair exchange mechanisms for both connection-based and message-based mix networks. In connection-based mix networks, our protocols achieve fairness in a weak sense: no player can benefit from stopping the exchange prematurely. In message-based mix networks, by taking advantage of each mix's next-hop neighbor as a rational third party, our exchange protocol guarantees strict fairness between initiators and mixes: either both parties successfully exchange payment and service or neither gains anything. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Reiter, M. K., Wang, X. F., & Wright, M. (2005). Building reliable mix networks with fair exchange. In Lecture Notes in Computer Science (Vol. 3531, pp. 378–392). Springer Verlag. https://doi.org/10.1007/11496137_26
Mendeley helps you to discover research relevant for your work.