@mastersthesis{mteich-2017,
  title = {Implementing Privacy Preserving Auction Protocols}, 
  author = {Markus Teich}, 
  school = {TUM}, 
  volume = {Master of Science}, 
  year = {2017}, 
  month = {February}, 
  address = {Munich}, 
  pages = {0--100}, 
  editor = {Totakura, Sree Harsha and Grothoff, Christian and Felix Brandt}, 
  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}, 
  www_section = {auctions, GNUnet, secure multi-party computation}, 
  www_tags = {selected}, 
  www_pdf_url = {https://git.gnunet.org/bibliography.git/plain/docs/thesis_0.pdf}, 
  url = {https://bibliography.gnunet.org}, 
}