Darmstadt-Warsaw Research Seminar on Cryptography and Blockchains: Tight Consistency Bounds For Nakamoto Consensus

Organizer:
Prof. Sebastian Faust (TU Darmstadt)
Prof. Stefan Dziembowski (University of Warsaw)

Abstract

In this talk I will present our recent result from CCS 2020 where we give a tight answer to the following question:
Given some honest hashing power and some bound on network delays, how much adversarial hashing power can Bitcoin safely tolerate?
If time permits, I will also discuss how this extends to proof of stake, and briefly mention follow-up work that focuses on obtaining practical settlement bounds.
This is joint work with Aggelos Kiayias and Alexander Russell, the accompanying full paper can be found at https://eprint.iacr.org/2020/661.

Short bio

https://iohk.io/en/team/peter-gazi

Links

• Talk: Online via Zoom
• Networking: Online – the link will be shared during the Zoom session