World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
34
Citations
5150
World Ranking
12147
National Ranking
230

Overview

Serge Fehr is affiliated with the Centrum Wiskunde & Informatica in the Netherlands. Their research primarily spans the fields of computer science and mathematics, with distinct subfields that include artificial intelligence, computational theory and mathematics, information systems, geometry and topology, and electrical and electronic engineering.

The scientist has contributed extensively to topics related to cryptography and data security, complexity and algorithms in graphs, quantum computing algorithms and architecture, cryptographic implementations and security, geometric and algebraic topology, cloud data security solutions, and logic, programming, and type systems.

Fehr's publication record features a number of recent papers, reflecting ongoing engagement with advanced topics in cryptographic theory and quantum security:

  • "Fiat-Shamir Transformation of Multi-Round Interactive Proofs (Extended Version)", 2023, Journal of Cryptology
  • "New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment", 2022, Journal of Medical Systems
  • "On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work", 2021, Lecture notes in computer science
  • "Online-Extractability in the Quantum Random-Oracle Model", 2021, arXiv (Cornell University)
  • "On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work", 2020, arXiv (Cornell University)

Fehr frequently publishes in venues such as arXiv (Cornell University), Journal of Cryptology, Journal of Medical Systems, and Lecture Notes in Computer Science. The most frequent publication platform is arXiv, where five papers have appeared.

The scientist collaborates regularly with several co-authors, including Jelle Don, Thomas Attema, Yu-Hsuan Huang, Christian Majenz, and Christian Schaffner, with ongoing partnerships as indicated by multiple co-authored works.

Best Publications

  • On quantum Rényi entropies: A new generalization and some properties

    Martin Müller-Lennert;Frédéric Dupuis;Oleg Szehr;Serge Fehr

  • Public Key Cryptography - PKC 2003

    Yvo G. Desmedt

  • Cryptography in the Bounded-Quantum-Storage Model

    Ivan B. DamgÅrd;Serge Fehr;Louis Salvail;Christian Schaffner

  • Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors

    Ronald Cramer;Yevgeniy Dodis;Serge Fehr;Carles Padró

  • On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles

    Alexandra Boldyreva;Serge Fehr;Adam O'Neill

  • Cryptography in the bounded quantum-storage model

    I.B. Damgard;S. Fehr;L. Salvail;C. Schaffner

  • Security of the Fiat-Shamir transformation in the Quantum Random-Oracle Model

    Jelle Don;Jelle Don;Serge Fehr;Serge Fehr;Christian Majenz;Christian Schaffner

  • On the Conditional Rényi Entropy

    Serge Fehr;Stefan Berens

  • A monogamy-of-entanglement game with applications to device-independent quantum cryptography

    Marco Tomamichel;Serge Fehr;Jędrzej Kaniewski;Stephanie Wehner

  • Position-Based Quantum Cryptography: Impossibility and Constructions

    Harry Buhrman;Nishanth Chandran;Serge Fehr;Ran Gelles

  • Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority

    Eli Ben-Sasson;Serge Fehr;Rafail Ostrovsky

  • A Tight High-Order Entropic Quantum Uncertainty Relation With Applications.

    Ivan Damgård;Serge Fehr;Renato Renner;Louis Salvail

  • A tight high-order entropic quantum uncertainty relation with applications

    Ivan B. Damgård;Serge Fehr;Renato Renner;Louis Salvail

  • Perfect NIZK with adaptive soundness

    Masayuki Abe;Serge Fehr

  • Secure identification and QKD in the bounded-quantum-storage model

    Ivan Damgård;Serge Fehr;Louis Salvail;Christian Schaffner

  • Efficient Multi-Party Computation over Rings.

    Ronald Cramer;Serge Fehr;Yuval Ishai;Eyal Kushilevitz

  • Security and composability of randomness expansion from Bell inequalities

    Serge Fehr;Ran Gelles;Christian Schaffner;Christian Schaffner

  • Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups.

    Ronald Cramer;Serge Fehr

  • Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography

    Masayuki Abe;Serge Fehr

  • Efficient multi-party computation over rings

    Ronald Cramer;Serge Fehr;Yuval Ishai;Eyal Kushilevitz

  • Secure identification and QKD in the bounded-quantum-storage model

    Ivan B. Damgård;Serge Fehr;Louis Salvail;Christian Schaffner

  • Encryption schemes secure against chosen-ciphertext selective opening attacks

    Serge Fehr;Dennis Hofheinz;Eike Kiltz;Hoeteck Wee

  • Optimal black-box secret sharing over arbitrary Abelian groups

    Ronald Cramer;Serge Fehr

  • Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks

    Ivan B. Damgård;Serge Fehr;Louis Salvail

  • Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks

    Ivan Damgård;Serge Fehr;Louis Salvail

  • Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions.

    Ronald Cramer;Ivan Bjerre Damgård;Nico Döttling;Serge Fehr

  • On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase

    Ronald Cramer;Ivan Damgård;Serge Fehr

Frequent Co-Authors

Christian Schaffner
Christian Schaffner University of Amsterdam
Ivan Damgård
Ivan Damgård Aarhus University
Ronald Cramer
Ronald Cramer Leiden University
Harry Buhrman
Harry Buhrman University of Amsterdam
Rafail Ostrovsky
Rafail Ostrovsky University of California, Los Angeles
Masayuki Abe
Masayuki Abe Kyoto University
Vipul Goyal
Vipul Goyal Carnegie Mellon University
Stephanie Wehner
Stephanie Wehner Delft University of Technology
Renato Renner
Renato Renner ETH Zurich
Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology

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 degrees can be a strategic way to start your journey in Computer Science, especially if you want to save on tuition. There are many cheapest online colleges that provide flexible learning options without compromising on quality.

If you're concerned about past academic performance, consider online schools that accept low gpa. These institutions often offer supportive environments to help students catch up and succeed in high-demand fields like Computer Science.

Fast-track options are available too. For those who want to quickly enter the workforce, a 1 year computer science degree online can provide accelerated learning without compromising essential skills.

Computer Science skills also open doors to other rapidly growing fields. For example, professionals with science and tech backgrounds often pursue high-paying jobs with environmental science degree, combining technical expertise with impactful careers in sustainability and research.

Best Scientists Citing Serge Fehr

Trending Scientists

Recently Published Articles