World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
4892
World Ranking
10385
National Ranking
519

Overview

Sebastian Faust is affiliated with the Technical University of Darmstadt in Germany and has contributed extensively to the field of computer science. Their research spans multiple subfields, with a significant focus on cryptography and related areas.

Their main fields of study include:

  • Computer Science

Within this broader field, they have worked on several specialized subfields:

  • Artificial Intelligence
  • Information Systems
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications
  • Hardware and Architecture

The main topics covered in their work emphasize security and cryptography:

  • Cryptography and Data Security
  • Cryptographic Implementations and Security
  • Blockchain Technology Applications and Security
  • Chaos-based Image/Signal Encryption
  • Coding theory and cryptography
  • Physical Unclonable Functions (PUFs) and Hardware Security
  • Distributed systems and fault tolerance

Notable recent publications by Sebastian Faust include:

  • Continuously Non-malleable Codes in the Split-State Model, 2020, Journal of Cryptology
  • Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma, 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Provable Secure Parallel Gadgets, 2023, IACR Transactions on Cryptographic Hardware and Embedded Systems
  • MOE: Multiplication Operated Encryption with Trojan Resilience, 2021, IACR Transactions on Symmetric Cryptology
  • Prisma: A Tierless Language for Enforcing Contract-Client Protocols in Decentralized Applications (Extended Abstract), 2022, arXiv (Cornell University)

Their publications have appeared frequently in several venues, including:

  • IACR Transactions on Cryptographic Hardware and Embedded Systems
  • arXiv (Cornell University)
  • Journal of Cryptology
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • IACR Transactions on Symmetric Cryptology

Sebastian Faust often collaborates with the following coauthors:

  • David Kretzler
  • Maximilian Orlt
  • Benjamin Schlosser
  • Carmit Hazay
  • François-Xavier Standaert

Additionally, Sebastian Faust has contributed to book publications with Springer Science+Business Media, including two editions of Public-Key Cryptography - PKC 2022.

Best Publications

  • Proofs of Space

    Stefan Dziembowski;Sebastian Faust;Vladimir Kolmogorov;Krzysztof Z Pietrzak

  • Protecting circuits from leakage: the computationally-bounded and noisy cases

    Sebastian Faust;Tal Rabin;Leonid Reyzin;Eran Tromer

  • General State Channel Networks

    Stefan Dziembowski;Sebastian Faust;Kristina Hostáková

  • FairSwap: How To Fairly Exchange Digital Goods

    Stefan Dziembowski;Lisa Eckey;Sebastian Faust

  • Unifying Leakage Models: From Probing Attacks to Noisy Leakage

    Alexandre Duc;Stefan Dziembowski;Stefan Dziembowski;Sebastian Faust

  • Perun: Virtual Payment Hubs over Cryptocurrencies

    Stefan Dziembowski;Lisa Eckey;Sebastian Faust;Daniel Malinowski

  • Making Masking Security Proofs Concrete - Or How to Evaluate the Security of any Leaking Device

    Alexandre Duc;Sebastian Faust;Sebastian Faust;François-Xavier Standaert

  • Leakage-resilient signatures

    Sebastian Faust;Eike Kiltz;Krzysztof Pietrzak;Guy N. Rothblum

  • Making Masking Security Proofs Concrete

    Alexandre Duc;Sebastian Faust;François-Xavier Standaert

  • Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model

    Gilles Barthe;François Dupressoir;Sebastian Faust;Benjamin Grégoire

  • On the Non-malleability of the Fiat-Shamir Transform.

    Sebastian Faust;Markulf Kohlweiss;Giorgia Azzurra Marson;Daniele Venturi

  • Secure two-party computation with low communication

    Ivan Damgård;Sebastian Faust;Carmit Hazay

  • Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits

    Sebastian Faust;Pratyay Mukherjee;Daniele Venturi;Daniel Wichs

  • Continuous Non-malleable Codes

    Sebastian Faust;Pratyay Mukherjee;Jesper Buus Nielsen;Daniele Venturi

  • Composable Masking Schemes in the Presence of Physical Defaults & the Robust Probing Model

    Sebastian Faust;Vincent Grosso;Santos Merino Del Pozo;Clara Paglialonga

  • Leakage-Resilient Cryptography From the Inner-Product Extractor.

    Stefan Dziembowski;Sebastian Faust

  • Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier

    Ivan Damgård;Sebastian Faust;Pratyay Mukherjee;Daniele Venturi

  • Practical leakage-resilient symmetric cryptography

    Sebastian Faust;Krzysztof Pietrzak;Joachim Schipper

  • Multi-party Virtual State Channels

    Stefan Dziembowski;Lisa Eckey;Sebastian Faust;Julia Hesse

  • Generalized Channels from Limited Blockchain Scripts and Adaptor Signatures

    Lukas Aumayr;Oguzhan Ersoy;Andreas Erwig;Sebastian Faust

  • FastKitten: Practical Smart Contracts on Bitcoin

    Poulami Das;Lisa Eckey;Tommaso Frassetto;David Gens

  • Making Masking Security Proofs Concrete (Or How to Evaluate the Security of Any Leaking Device), Extended Version

    Alexandre Duc;Sebastian Faust;François-Xavier Standaert

Frequent Co-Authors

Stefan Dziembowski
Stefan Dziembowski University of Warsaw
François-Xavier Standaert
François-Xavier Standaert Université Catholique de Louvain
Krzysztof Pietrzak
Krzysztof Pietrzak Institute of Science and Technology Austria
Carmit Hazay
Carmit Hazay Bar-Ilan University
Jesper Buus Nielsen
Jesper Buus Nielsen Aarhus University
Ivan Damgård
Ivan Damgård Aarhus University
Eran Tromer
Eran Tromer Tel Aviv University
Leonid Reyzin
Leonid Reyzin Boston University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degree options can open up diverse pathways in computer science and related fields. Many students consider pursuing one of the most valuable masters degrees to increase job prospects and earning potential. These degrees often align with in-demand tech skills that employers are seeking.

For those looking for a quicker or more affordable route, 2 year online degrees can offer a strong foundation for entry-level roles or further study. Online programs also provide flexibility, making them attainable for working professionals or those balancing other commitments.

Budget-conscious learners should consider looking into the cheapest online degrees, which can help reduce student debt without compromising educational quality. Additionally, students concerned about GPA requirements can seek out a college that accepts low gpa, ensuring greater access to education in computer science and technology.

Whether starting out or advancing a career, these options make it easier than ever to tailor your learning journey to your personal goals and circumstances.

Best Scientists Citing Sebastian Faust

Trending Scientists

Recently Published Articles