| 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 | 127 | 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 | 85 | 2014 |
| 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 | 68* | 2018 |
| 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 | 41 | 2018 |
| How to prove knowledge of small secrets C Baum, I Damgård, KG Larsen, M Nielsen Annual International Cryptology Conference, 478-498, 2016 | 29 | 2016 |
| Towards Practical Lattice-Based One-Time Linkable Ring Signatures C Baum, H Lin, S Oechsner | 28 | 2018 |
| 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 | 25 | 2016 |
| Efficient secure multiparty computation with identifiable abort C Baum, E Orsini, P Scholl Theory of Cryptography Conference, 461-490, 2016 | 16 | 2016 |
| 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 | 12 | 2020 |
| On garbling schemes with and without privacy C Baum International Conference on Security and Cryptography for Networks, 468-485, 2016 | 11 | 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 | 10 | 2019 |
| Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. C Baum, V Lyubashevsky IACR Cryptol. ePrint Arch. 2017, 759, 2017 | 10 | 2017 |
| Insured mpc: Efficient secure computation with financial penalties C Baum, B David, R Dowsley Financial Cryptography and Data Security (FC), 2020 | 9* | 2020 |
| PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server. C Baum, TK Frederiksen, J Hesse, A Lehmann, A Yanai IACR Cryptol. ePrint Arch. 2019, 1470, 2019 | 4 | 2019 |
| TARDIS: Time And Relative Delays In Simulation. C Baum, B David, R Dowsley, JB Nielsen, S Oechsner IACR Cryptol. ePrint Arch. 2020, 537, 2020 | 3 | 2020 |
| Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE C Baum, D Escudero, A Pedrouzo-Ulloa, P Scholl, JR Troncoso-Pastoriza International Conference on Security and Cryptography for Networks, 130-149, 2020 | 1 | 2020 |
| A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols. C Baum, B David, R Dowsley IACR Cryptol. ePrint Arch. 2020, 207, 2020 | 1 | 2020 |
| Craft: Composable randomness and almost fairness from time C Baum, B David, R Dowsley, JB Nielsen, S Oechsner Cryptology ePrint Archive, Report 2020/784, 2020. https://eprint. iacr. org …, 0 | 1 | |
| Fairness in the Eyes of the Data: Certifying Machine-Learning Models S Segal, Y Adi, B Pinkas, C Baum, C Ganesh, J Keshet arXiv preprint arXiv:2009.01534, 2020 | | 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 | | 2020 |
Ivan DamgårdProfessor of Computer Science, Aarhus UniversityVerified email at cs.au.dk
