| Turning your weakness into a strength: Watermarking deep neural networks by backdooring Y Adi, C Baum, M Cisse, B Pinkas, J Keshet 27th USENIX Security Symposium (USENIX Security 18), 1615-1631, 2018 | 337 | 2018 |
| More efficient commitments from structured lattice assumptions C Baum, I Damgård, V Lyubashevsky, S Oechsner, C Peikert International Conference on Security and Cryptography for Networks, 368-385, 2018 | 128* | 2018 |
| Publicly auditable secure multi-party computation C Baum, I Damgård, C Orlandi International Conference on Security and Cryptography for Networks, 175-196, 2014 | 116 | 2014 |
| Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits⋆ C Baum, J Bootle, A Cerulli, R del Pino, J Groth, V Lyubashevsky IACR Crypto 2018, 2018 | 74 | 2018 |
| Towards Practical Lattice-Based One-Time Linkable Ring Signatures C Baum, H Lin, S Oechsner | 51 | 2018 |
| Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography C Baum, A Nof IACR International Conference on Public-Key Cryptography, 495-526, 2020 | 43 | 2020 |
| : Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions C Baum, AJ Malozemoff, MB Rosen, P Scholl Annual International Cryptology Conference, 92-122, 2021 | 38 | 2021 |
| How to prove knowledge of small secrets C Baum, I Damgård, KG Larsen, M Nielsen Annual International Cryptology Conference, 478-498, 2016 | 38 | 2016 |
| Using TopGear in overdrive: a more efficient ZKPoK for SPDZ C Baum, D Cozzo, NP Smart International Conference on Selected Areas in Cryptography, 274-302, 2019 | 34 | 2019 |
| Better preprocessing for secure multiparty computation C Baum, I Damgård, T Toft, R Zakarias International Conference on Applied Cryptography and Network Security, 327-345, 2016 | 29 | 2016 |
| P2DEX: privacy-preserving decentralized cryptocurrency exchange C Baum, B David, TK Frederiksen International Conference on Applied Cryptography and Network Security, 163-194, 2021 | 25 | 2021 |
| Efficient secure multiparty computation with identifiable abort C Baum, E Orsini, P Scholl Theory of Cryptography Conference, 461-490, 2016 | 25 | 2016 |
| TARDIS: a foundation of time-lock puzzles in UC C Baum, B David, R Dowsley, JB Nielsen, S Oechsner Annual International Conference on the Theory and Applications of …, 2021 | 24* | 2021 |
| Insured MPC: Efficient secure computation with financial penalties C Baum, B David, R Dowsley International Conference on Financial Cryptography and Data Security, 404-420, 2020 | 24* | 2020 |
| Banquet: Short and fast signatures from AES C Baum, CD Saint Guilhem, D Kales, E Orsini, P Scholl, G Zaverucha IACR International Conference on Public-Key Cryptography, 266-297, 2021 | 20 | 2021 |
| PESTO: proactively secure distributed single sign-on, or how to trust a hacked server C Baum, T Frederiksen, J Hesse, A Lehmann, A Yanai 2020 IEEE European Symposium on Security and Privacy (EuroS&P), 587-606, 2020 | 17 | 2020 |
| Efficient constant-round MPC with identifiable abort and public verifiability C Baum, E Orsini, P Scholl, E Soria-Vazquez Annual International Cryptology Conference, 562-592, 2020 | 17 | 2020 |
| Simple amortized proofs of shortness for linear relations over polynomial rings C Baum, V Lyubashevsky Cryptology ePrint Archive, 2017 | 17 | 2017 |
| CRAFT: Composable Randomness and Almost Fairness from Time. C Baum, B David, R Dowsley, JB Nielsen, S Oechsner IACR Cryptol. ePrint Arch. 2020, 784, 2020 | 16* | 2020 |
| Fairness in the eyes of the data: Certifying machine-learning models S Segal, Y Adi, B Pinkas, C Baum, C Ganesh, J Keshet Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society, 926-935, 2021 | 14 | 2021 |
Ivan DamgårdProfessor of Computer Science, Aarhus UniversityVerified email at cs.au.dk
