On January 6, 2021, the 3rd SFB 901 seminar in the winter semester will take place.
4:00 - 5:00 subproject C1
Speakers: Prof. Dr. Johannes Blömer + Henrik Bröcher
Title: Secure Multi-Party Computation (adversarial and rational) for the OTF Market
The talk will be held via BigBlueButton.
Secure multi-party computation allows parties to jointly compute the outcome of a function over their private inputs, while keeping these inputs private.
For example, each party may bid in an auction. Using multi-party computation the parties can jointly determine the winning bid and its corresponding bidder without revealing any other bids or relying on a central (trusted) auctioneer.
Secure multi-party computation is a classical field in cryptography with various security and privacy models, general results, and, in recent years, efficient implementations for specific practical applications. Traditionally, multi-party computation considers cryptographic scenarios, i.e. it considers worst-case adversarial behaviour. For several years, combinations of multi-party computation with game theory have been studied intensively. Here, adversarial behaviour is modelled via rational agents instead of worst-case. Then, multi-party protocols must be modelled and designed as (Nash) equilibria in strategic games. In this talk we introduce secure multi-party computation as well as its connection and combination with game theory. We describe how multi-party computation can be used in OTF markets to further decentralize the market, in particular, lessen the reliance on and the power of OTF requesters and providers. Finally, we discuss some of the research challenges when applying adversarial or rational multi-party computation in the OTF context.