Portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 2
Published in arXiv, 2020
Algebraic representation of the theory underlying quorum systems
Download here
Published in ICDCS, 2021
Consensus number of ERC20-like smart contracts. Blog Post
Download here
Published in CBT, 2021
Asymmetric Asynchronous Byzantine Consensus. Blog Post
Download here
Published in SRDS, DISC (Brief Announcement), 2021
How to Trust Strangers: Composition of Byzantine Quorum Systems. Blog Post
Download here
Published in DISC, 2021
Brief Announcement: Revisiting Signature-Free Asynchronous Byzantine Consensus. Blog Post
Download here
Published in FC, 2022
Quick Order Fairness. Blog Post
Published:
How to Trust Strangers: Composition of Byzantine Quorum Systems
Published:
BA: Revisiting signature-free asynchronous Byzantine consensus
Published:
Asymmetric Asynchronous Byzantine Consensus
Published:
Quick Order Fairness
MSc course - English, University of Bern, Institute of Computer Science, 2019
Cryptography addresses the protection of data in the digital world; it has become a crucial technology for the information society, with influence to public policy and questions of privacy. This course presents an introduction to modern cryptography. Based on mathematical models for reasoning about the security of information systems, the course explains the fundamental concepts of cryptography and discusses the most important cryptographic algorithms that are in everyday use on the Internet. It covers security proofs, computational security, pseudorandomness, block ciphers, hash functions, and message authentication. Public-key cryptosystems and public-key signature schemes that rely on number-theoretic primitives are also introduced and some elementary cryptographic protocols will be presented.
BSc course - German, University of Bern, Institute of Computer Science, 2020
Diese Vorlesung führt in diskrete Mathematik ein und behandelt eine Reihe von zentralen Methoden und Konzepten, welche wichtig sind für das tiefere Verständnis der Informatik. Diskrete Mathematik ist ein Teilgebiet der Mathematik, das sich hauptsächlich mit endlichen und abzählbaren Strukturen beschäftigt. Wichtige Themen sind zuerst Mengen, Relationen und Funktionen. Es folgen Grundlagen der Algebra und Zahlentheorie, welche auch für kryptographische Verfahren oder Codierungstheorie die Basis bilden. Darüber hinaus werden Konzepte aus der Graphentheorie vorgestellt und die Grundlagen der Logik eingeführt, insbesondere Aussagenlogik und Prädikatenlogik. Die Vorlesung dient auch der Vorbereitung auf weitergehende Themen der theoretischen Informatik, wie Berechenbarkeit, Komplexität, Effizienz und probabilistische Algorithmen.
MSc course - English, University of Bern, Institute of Computer Science, 2021
The reliance of the information society on pervasive networks, mobile computing, online services, and cloud platforms continues to grow. The privacy of human activities and the security of personal data are challenged by today’s information technology in ways never seen before in history. This course focuses on privacy and security in a digital world. It presents cryptographic and non-cryptographic methods relevant for protecting privacy, anonymity, and data security. Topics include pseudonymity, data anonymization and de-anonymization, notions of privacy and privacy regulation, measures for the privacy of data, steganography and traffic hiding, network anonymity, and censorship resistance. Systems like onion routing (TOR) and Freenet are presented. Knowledge in computer science and networking is needed, but no background in cryptography is expected.