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. MoZZarella: Efficient Vector-OLE and Zero-Knowledge proofs over Z2k, with Lennart Braun, Alexander Munch-Hansen and Peter Scholl. To appear at CRYPTO 2022
  2. FETA: Efficient Threshold Designated-Verifier Zero-Knowledge proofs, with Robin Jadoul and Emmanuela Orsini and Peter Scholl and Nigel P. Smart. To appear at ACM CCS 2022
  3. SoK: Mitigation of Front-running in Decentralized Finance, with James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen and Lorenzo Gentile. Financial Crypto DeFi Workshop 2022
  4. Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k, with Lennart Braun, Alexander Munch-Hansen and Peter Scholl. ACM CCS 2021
  5. Mac’n’Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions, with Alex J. Malozemoff, Marc Rosen and Peter Scholl. CRYPTO 2021
  6. Fairness in the Eyes of the Data: Certifying Machine-Learning Models, with Shahar Segal, Yossi Adi, Benny Pinkas, Chaya Ganesh and Joseph Keshet. AAAI/ACM 2021 Conference on Artificial Intelligence, Ethics and Society. There also exists a poster which you can see here
  7. P2DEX: Privacy-Preserving Decentralized Currency Exchange, with Bernardo David and Tore Frederiksen. ACNS 2021
  8. Lattice-Based Proof of Shuffle and Applications to Electronic Voting, with Diego Aranha, Kristian Gjøsteen, Tjerand Silde and Thor Tunge. CT-RSA 2021
  9. Banquet: Short and Fast Signatures from AES, with Cyprien Delpech de Saint Guilhem and Daniel Kales and Emmanuela Orsini and Peter Scholl and Greg Zaverucha. PKC 2021
  10. A Foundation of Time-Lock Puzzles in UC, with Bernardo David, Rafael Dowsley, Sabine Oechsner and Jesper Buus Nielsen. Eurocrypt 2021
  11. 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. An extended version of the paper has also been published in the Journal of Computer Security.
  12. Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability, with Emmanuela Orsini, Peter Scholl and Eduardo Soria-Vazquez, CRYPTO 2020
  13. 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
  14. Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography, with Ariel Nof, PKC 2020
  15. Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort, with Bernardo David and Rafael Dowsley, Financial Crypto 2020
  16. Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ, with Daniele Cozzo and Nigel P. Smart, SAC 2019
  17. Towards Practical Lattice-Based One-Time Linkable Ring Signatures, with Huang Lin and Sabine Oechsner, ICICS 2018
  18. More Efficient Commitments from Structured Lattice Assumptions, with Ivan Damgård and Vadim Lyubashevsky and Sabine Oechsner and Chris Peikert, SCN 2018
  19. 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.
  20. 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
  21. How to prove knowledge of small secrets, with Ivan Damgård and Kasper Green Larsen and Michael Nielsen, CRYPTO 2016
  22. 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
  23. On Garbling Schemes with and without Privacy, SCN 2016
  24. Better Preprocessing for Secure Multiparty Computation, with Ivan Damgård and Tomas Toft and Rasmus Lauritzen, ACNS 2016
  25. Publicly Auditable Secure Multiparty Computation, with Ivan Damgård and Claudio Orlandi, SCN 2014

Peer-reviewed work outside of Cryptography


In the Spring 2021 term I was 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 2021, CCS 2021, ACISP 2021, PKC 2022.

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 Philanthropy (project SecureDNA).


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