World's Best Scientists 2026 revealed!
Christian Schaffner

Christian Schaffner

D-Index & Metrics

Computer Science

D-Index
32
Citations
5664
World Ranking
13009
National Ranking
246

Overview

Christian Schaffner is a researcher affiliated with the University of Amsterdam in the Netherlands. Their work spans several fields within computer science, focusing notably on areas related to cryptography and quantum computing.

Their research covers key topics including:

  • Cryptography and Data Security
  • Quantum Computing Algorithms and Architecture
  • Quantum Information and Cryptography
  • Complexity and Algorithms in Graphs
  • Cloud Data Security Solutions
  • Cryptographic Implementations and Security
  • Quantum Mechanics and Applications

Schaffner has contributed to areas of study such as:

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Information Systems
  • Electrical and Electronic Engineering
  • Atomic and Molecular Physics, and Optics

Their publication record includes papers in various venues, with a strong presence in:

  • arXiv (Cornell University)
  • Lecture notes in computer science
  • 2022 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe)
  • Physical review. A/Physical review, A
  • Quantum

Some recent notable papers authored or co-authored by Schaffner are:

  • "Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits" (2021, Lecture notes in computer science)
  • "Optimal Design of Time-of-Use Tariffs using Bilevel Optimization" (2022, 2022 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe))
  • "Online-Extractability in the Quantum Random-Oracle Model" (2021, arXiv (Cornell University))
  • "Local simultaneous state discrimination" (2024, Physical review. A/Physical review, A)
  • "Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits" (2020, arXiv (Cornell University))

Frequent collaborators in Schaffner's research include:

  • Christian Majenz
  • Mehrdad Tahmasbi
  • Jelle Don
  • Serge Fehr
  • Yfke Dulek

Their academic work is embedded in the broader context of computer science, with 35 publications contributing to the main field and 26 publications specifically addressing artificial intelligence. Four publications highlight work in computational theory and mathematics, while two focus on information systems and electrical and electronic engineering each, complemented by two in atomic and molecular physics, and optics.

Best Publications

  • The Operational Meaning of Min- and Max-Entropy

    R. Konig;R. Renner;C. Schaffner

  • The operational meaning of min- and max-entropy

    Robert Koenig;Renato Renner;Christian Schaffner

  • Cryptography in the Bounded-Quantum-Storage Model

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

  • Random oracles in a quantum world

    Dan Boneh;Özgür Dagdelen;Marc Fischlin;Anja Lehmann

  • Leftover Hashing Against Quantum Side Information

    M. Tomamichel;C. Schaffner;A. Smith;R. Renner

  • Quantum cryptography beyond quantum key distribution

    Anne Broadbent;Christian 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

  • A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model

    Eike Kiltz;Vadim Lyubashevsky;Christian Schaffner

  • Cryptography from noisy storage.

    Stephanie Wehner;Christian Schaffner;Barbara M. Terhal

  • Leftover Hashing against quantum side information

    Marco Tomamichel;Renato Renner;Christian Schaffner;Adam Smith

  • Position-Based Quantum Cryptography: Impossibility and Constructions

    Harry Buhrman;Nishanth Chandran;Serge Fehr;Ran Gelles

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

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

  • Quantum Homomorphic Encryption for Polynomial-Sized Circuits

    Yfke Dulek;Christian Schaffner;Florian Speelman

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

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

  • Security and composability of randomness expansion from Bell inequalities

    Serge Fehr;Ran Gelles;Christian Schaffner;Christian Schaffner

  • Complete Insecurity of Quantum Protocols for Classical Two-Party Computation

    Harry Buhrman;Matthias Christandl;Christian Schaffner

  • Semantic Security and Indistinguishability in the Quantum World

    Tommaso Gagliardoni;Andreas Hülsing;Christian Schaffner

  • Using Simon's Algorithm to Attack Symmetric-Key Cryptographic Primitives

    Thomas Santoli;Christian Schaffner

  • Implementation of two-party protocols in the noisy-storage model

    Stephanie Wehner;Marcos Curty;Christian Schaffner;Hoi-Kwong Lo

  • Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model

    Christian Schaffner

Frequent Co-Authors

Serge Fehr
Serge Fehr Centrum Wiskunde & Informatica
Harry Buhrman
Harry Buhrman University of Amsterdam
Ivan Damgård
Ivan Damgård Aarhus University
Stephanie Wehner
Stephanie Wehner Delft University of Technology
Renato Renner
Renato Renner ETH Zurich
Barbara M. Terhal
Barbara M. Terhal Delft University of Technology
Leen Stougie
Leen Stougie Centrum Wiskunde & Informatica
Rafail Ostrovsky
Rafail Ostrovsky University of California, Los Angeles
Dan Boneh
Dan Boneh Stanford University
Marc Fischlin
Marc Fischlin Technical University of Darmstadt

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 Computer Science doesn’t always mean following a traditional on-campus path. Today, there are numerous 1 year associate degree programs online that let you quickly gain essential tech skills and credentials. These programs are designed for flexibility, enabling you to balance studies with work or family responsibilities.

Affordability is another major factor for many students. If you’re seeking quality education at a lower cost, research the cheapest online college options to help minimize student debt and make a computer science degree more accessible.

Worried about your academic record? Many online graduate schools with low gpa requirements provide opportunities for admission without stringent GPA cutoffs. These institutions support diverse learners eager to advance their careers in tech or related fields.

Graduates with computer science backgrounds can find rewarding roles in various sectors. Interdisciplinary pathways—such as combining tech expertise with environmental or education knowledge—open up jobs similar to those available to individuals with an jobs with elementary education and environmental science degree. Broaden your horizons and explore where an online degree in computer science can take you.

Best Scientists Citing Christian Schaffner

Trending Scientists

Recently Published Articles