Sciweavers

Share
ACNS
2005
Springer

Building Reliable Mix Networks with Fair Exchange

10 years 10 months ago
Building Reliable Mix Networks with Fair Exchange
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 messagebased 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.
Michael K. Reiter, XiaoFeng Wang, Matthew Wright
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where ACNS
Authors Michael K. Reiter, XiaoFeng Wang, Matthew Wright
Comments (0)
books