I’m an Assistant Professor at the Computer Science Department at Aarhus University, Denmark. My research focus is on (applied) secure computation as well as (lattice-based) zero knowledge protocols. Furthermore, I am interested into security for machine learning and secure protocol design using public ledgers.

Before starting on this position I have been a Postdoc at Aarhus University and Bar Ilan University, Israel. I obtained my PhD in 2016 from Aarhus University.


Peer-reviewed Publications

  1. Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE, with Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl and Juan Ramón Troncoso-Pastoriza, SCN 2020
  2. Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability, with Emmanuela Orsini, Peter Scholl and Eduardo Soria-Vazquez, CRYPTO 2020
  3. PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server, with Tore K. Frederiksen, Julia Hesse, Anja Lehmann and Avishay Yanai, EuroS&P 2020
  4. Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography, with Ariel Nof, PKC 2020
  5. Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort, with Bernardo David and Rafael Dowsley, Financial Crypto 2020
  6. Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ, with Daniele Cozzo and Nigel P. Smart, SAC 2019
  7. Towards Practical Lattice-Based One-Time Linkable Ring Signatures, with Huang Lin and Sabine Oechsner, ICICS 2018
  8. More Efficient Commitments from Structured Lattice Assumptions, with Ivan Damgård and Vadim Lyubashevsky and Sabine Oechsner and Chris Peikert, SCN 2018
  9. Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring, with Yossi Adi and Moustapha Cisse and Joseph Keshet and Benny Pinkas, USENIX 2018.
  10. Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits, with Jonathan Bootle and Andrea Cerulli and Rafael del Pino and Jens Groth and Vadim Lyubashevsky, CRYPTO 2018
  11. How to prove knowledge of small secrets, with Ivan Damgård and Kasper Green Larsen and Michael Nielsen, CRYPTO 2016
  12. Efficient Secure Multiparty Computation with Identifiable Abort, with Emmanuela Orsini and Peter Scholl, TCC-B 2016. A poster of this work can be found here
  13. On Garbling Schemes with and without Privacy, SCN 2016
  14. Better Preprocessing for Secure Multiparty Computation, with Ivan Damgård and Tomas Toft and Rasmus Lauritzen, ACNS 2016
  15. Publicly Auditable Secure Multiparty Computation, with Ivan Damgård and Claudio Orlandi, SCN 2014


In the Spring 2021 term I will be teaching Optimization and Complexity together with Kristoffer Arnsfelt Hansen.

In the Fall 2020 term I have been teaching some parts of the Cryptographic Computing course at AU alongside Claudio Orlandi and Peter Scholl.

Other Work

I am organizing a Summer School on Secure Multiparty Computation together with Bernardo David from ITU Copenhagen. Currently postponed due to COVID-19 but will eventually happen!

I’ve been a Program Committee member of ACNS 2017, CCS 2019 Workshop on Privacy-Preserving Machine Learning, CCS 2019 Workshop on Encrypted Computing & Applied Homomorphic Cryptography ,The AAAI-20 Workshop on Privacy-Preserving Artificial Intelligence 2020 and 2021, IEEE ICME, LatinCrypt 2020, CCS 2021.

I gave a presentation about Secure Computation in Tel Aviv in 2018. Here is a link to the video.


My work is currently funded by the DARPA SIEVE program (project FROMAGER) and the Open Philantropy (project SecureDNA).


E-Mail: cbaum at cs dot au dot dk
Twitter: @BaumCarsten
LinkedIn: carsten-baum
Office: 5335-293 (Nygaard Building)