You are here

Implementing Privacy Preserving Auction Protocols

TitleImplementing Privacy Preserving Auction Protocols
Publication TypeThesis
Year of Publication2017
AuthorsTeich, M
Secondary AuthorsTotakura, SHarsha, Grothoff, C, Brandt, F
DegreeMaster of Science
Number of Pages100
Date Published02/2017
UniversityTUM
CityMunich
Keywordsauctions, GNUnet, secure multi-party computation
Abstract

In this thesis we translate Brandt’s privacy preserving sealed-bid online auction protocol from RSA to elliptic curve arithmetic and analyze the theoretical and practical benefits. With Brandt’s protocol, the auction outcome is completely resolved by the bidders and the seller without the need for a trusted third party. Loosing bids are not revealed to anyone. We present libbrandt, our implementation of four algorithms with different outcome and pricing properties, and describe how they can be incorporated in a real-world online auction system. Our performance measurements show a reduction of computation time and prospective bandwidth cost of over 90% compared to an implementation of the RSA version of the same algorithms. We also evaluate how libbrandt scales in different dimensions and conclude that the system we have presented is promising with respect to an adoption in the real world.