| 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 | 787 | 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 | 200* | 2018 |
| Publicly auditable secure multi-party computation C Baum, I Damgård, C Orlandi Security and Cryptography for Networks: 9th International Conference, SCN …, 2014 | 156 | 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 | 112 | 2018 |
| : Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions C Baum, AJ Malozemoff, MB Rosen, P Scholl Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 111 | 2021 |
| 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 | 100 | 2020 |
| Towards Practical Lattice-Based One-Time Linkable Ring Signatures C Baum, H Lin, S Oechsner | 91 | 2018 |
| P2DEX: privacy-preserving decentralized cryptocurrency exchange C Baum, B David, TK Frederiksen International Conference on Applied Cryptography and Network Security, 163-194, 2021 | 71 | 2021 |
| 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 | 68 | 2019 |
| Banquet: short and fast signatures from AES C Baum, CD de Saint Guilhem, D Kales, E Orsini, P Scholl, G Zaverucha IACR International Conference on Public-Key Cryptography, 266-297, 2021 | 59 | 2021 |
| 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 | 56* | 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 | 49 | 2020 |
| Insured MPC: efficient secure computation with financial penalties C Baum, B David, R Dowsley Financial Cryptography and Data Security: 24th International Conference, FC …, 2020 | 48* | 2020 |
| Efficient secure multiparty computation with identifiable abort C Baum, E Orsini, P Scholl Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016 | 43 | 2016 |
| 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 | 42 | 2020 |
| How to prove knowledge of small secrets C Baum, I Damgård, KG Larsen, M Nielsen Annual International Cryptology Conference, 478-498, 2016 | 42 | 2016 |
| 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 | 41 | 2016 |
| Sok: Mitigation of front-running in decentralized finance C Baum, J Hsin-yu Chiang, B David, TK Frederiksen, L Gentile International Conference on Financial Cryptography and Data Security, 250-271, 2022 | 39 | 2022 |
| CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time C Baum, B David, R Dowsley, R Kishore, JB Nielsen, S Oechsner IACR International Conference on Public-Key Cryptography, 439-470, 2023 | 37* | 2023 |
| Mozarella: Efficient Vector-OLE and Zero-Knowledge Proofs over C Baum, L Braun, A Munch-Hansen, P Scholl Annual International Cryptology Conference, 329-358, 2022 | 35 | 2022 |
Peter SchollAarhus UniversityVerified email at cs.au.dk
