QuSoft QuSoft QuSoft QuSoft
  • Home
  • Research
  • Education
  • News
  • Events
  • About
    • Partners
  • People
  • Jobs
  • Lustrum
  • Contact
QuSoft QuSoft
  • Home
  • Research
  • Education
  • News
  • Events
  • About
    • Partners
  • People
  • Jobs
  • Lustrum
  • Contact
Dec 27

DR. CHRISTIAN SCHAFFNER

Associate professor at UvA (ILLC)

Email: C.Schaffner at uva.nl
Website: http://homepages.cwi.nl/~schaffne
Research lines: Cryptography in a quantum world and Quantum information science

Christian Schaffner received a diploma degree in mathematics from ETH Zurich (Switzerland) in 2003 and a PhD degree in computer science from Aarhus University (Denmark) in 2007. After three years as postdoctoral scholar at Centrum Wiskunde & Informatica (CWI), he is currently an Associate Professor of Theoretical Computer Science at the Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam. He is a VENI and VIDI laureate, has served on various program committees and is currently chairing the steering committee of the annual QCrypt conference.

His research interest is quantum cryptography in a broad sense: On the one hand, he develops new quantum protocols (e.g. for position-based cryptography or homomorphic encryption), on the other hand, he studies quantum-safe cryptography and develops quantum-information-theoretic tools. He is interested in outreach and educating people about the quantum nature of the world and the implications for cryptography.

Relevant publications:
Ivan Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner, Cryptography in the Bounded Quantum-Storage Model, https://arxiv.org/abs/quant-ph/0508222, In SIAM Journal of Computing, volume 37, number 6, pages 1865-1890, 2008.

Robert König, Renato Renner and Christian Schaffner, The operational meaning of min- and max-entropy, http://arxiv.org/abs/0807.1338, In IEEE Transactions on Information Theory, volume 55, number 9, pages 4337-4347, 2009.

Yfke Dulek, Christian Schaffner and Florian Speelman, Quantum homomorphic encryption for polynomial-sized circuits, http://arxiv.org/abs/1603.09717, presented at QCRYPT 2016 and at QIP 2017 (best student paper award), In CRYPTO 2016, Proceedings of Advances in Cryptology, LNCS 9816, pages 3-32, 2016.

  • Facebook
  • Twitter
  • Google+
  • LinkedIn
  • E-Mail

Comments are closed.

QuSoft

Amsterdam

© 2019 QuSoft · design by _blank