Oberseminar über Smart Contracts
(MA 5: Modul 5; MSc Mod 5: Modul 5)
Dozent | Zeit | Raum | Erstmals am |
---|---|---|---|
Sebastian Faust Gregor Leander Alexander May |
montags 10:00 - 11:00 | NA 5/64 | 27. März 2017 |
Datum | Vortragende Person | Titel | Literatur |
---|---|---|---|
27.03. | Sebastian Faust | Intro to Cryptocurrencies and Research Challenges | |
03.04. | Sebastian Faust | Intro to Cryptocurrencies and Research Challenges, Part II | |
10.04. | Lisa Eckey | Scalability via Payment Channels | 13 |
24.04. | Hendrik Waldner | Secure Multiparty Computations on Bitcoin | 9 |
08.05. | Kristina Hostakova | How to use bitcoin to design fair protocols. | 10 |
15.05. | Andre Esser | Improvements to Secure Computation with Penalties | 11 |
22.05. | Niklas Müller | Introduction to Ethereum | 12 |
29.05. | Andreas Gladisch | Micro Payment | |
12.06. | Leif Both | Majority is not enough: Bitcoin mining is vulnerable | 14 |
19.06. | Clara Paglialonga | The Miner's Dilemma | 15 |
17.07. | Alex May | High Parallel Complexity Graphs and Memory-Hard Functions | 6 |
- 2. Analysis of the Blockchain Protocol in Asynchronous Networks, Rafael Pass and Lior Seeman and abhi shelat
- 2. Juan A. Garay, Aggelos Kiayias, Nikos Leonardos: The Bitcoin Backbone Protocol: Analysis and Applications. EUROCRYPT (2) 2015: 281-310
- 3. FruitChains: A Fair Blockchain, Rafael Pass and Elaine Shi. Julian
- 4. The Sleepy Model of Consensus, Iddo Bentov, Rafael Pass and Elaine Shi
- 5. Hybrid Consensus: Efficient Consensus in the Permissionless Model, Rafael Pass and Elaine Shi (können wir überspringen, da ansonsten vllt. zu viel Konsensus)
- 6. Joël Alwen, Vladimir Serbinenko:High Parallel Complexity Graphs and Memory-Hard Functions. STOC 2015: 595-603, Alex
- 7. Joël Alwen, Jeremiah Blocki:Efficiently Computing Data-Independent Memory-Hard Functions. CRYPTO (2) 2016: 241-271
- 7. Joël Alwen, Jeremiah Blocki: Towards Practical Attacks on Argon2i and Balloon Hashing. IACR Cryptology ePrint Archive2016: 759 (2016), Friedrich
- 8. Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro: Scrypt is Maximally Memory-Hard. IACR Cryptology ePrint Archive 2016: 989 (2016)
- 9. Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski and Łukasz Mazurek, “Secure Multiparty Computations on Bitcoin”, The 35th IEEE Symposium on Security and Privacy (Oakland) 2014, Hendrik Waldner
- 10. Bentov, Iddo, and Ranjit Kumaresan. "How to use bitcoin to design fair protocols." International Cryptology Conference. Springer Berlin Heidelberg, 2014. Kristina
- 11. Ranjit Kumaresan, Vinod Vaikuntanathan, Prashant Nalini Vasudevan: Improvements to Secure Computation with Penalties. ACM Conference on Computer and Communications Security 2016: 406-417 Andre
- 11. Ranjit Kumaresan, Iddo Bentov: Amortizing Secure Computation with Penalties. ACM Conference on Computer and Communications Security 2016: 418-429
- 12. Introduction to Ethereum Niklas Müller
- 13. Scalability via Payment Channels, Lisa
- 14. Eyal, Ittay, and Emin Gün Sirer. "Majority is not enough: Bitcoin mining is vulnerable." International Conference on Financial Cryptography and Data Security. Springer Berlin Heidelberg, 2014, Leif
- 15. Ittay Eyal: The Miner's Dilemma. IEEE Symposium on Security and Privacy 2015: 89-103 Clara
- 16. The DAO attack and Making smart contracts smarter