Carsten Baum
Carsten Baum
Assistant Professor, Aarhus University
Verified email at cs.au.dk - Homepage
Title
Cited by
Cited by
Year
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
1202018
Publicly auditable secure multi-party computation
C Baum, I Damgård, C Orlandi
International Conference on Security and Cryptography for Networks, 175-196, 2014
832014
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
64*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
382018
How to prove knowledge of small secrets
C Baum, I Damgård, KG Larsen, M Nielsen
Annual International Cryptology Conference, 478-498, 2016
282016
Towards Practical Lattice-Based One-Time Linkable Ring Signatures
C Baum, H Lin, S Oechsner
272018
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
252016
Efficient secure multiparty computation with identifiable abort
C Baum, E Orsini, P Scholl
Theory of Cryptography Conference, 461-490, 2016
142016
On garbling schemes with and without privacy
C Baum
International Conference on Security and Cryptography for Networks, 468-485, 2016
112016
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
102020
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings.
C Baum, V Lyubashevsky
IACR Cryptol. ePrint Arch. 2017, 759, 2017
92017
Insured mpc: Efficient secure computation with financial penalties
C Baum, B David, R Dowsley
Financial Cryptography and Data Security (FC), 2020
8*2020
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
72019
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
42020
TARDIS: Time And Relative Delays In Simulation.
C Baum, B David, R Dowsley, JB Nielsen, S Oechsner
IACR Cryptol. ePrint Arch. 2020, 537, 2020
22020
A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols.
C Baum, B David, R Dowsley
IACR Cryptol. ePrint Arch. 2020, 207, 2020
12020
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
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
2020
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
The system can't perform the operation now. Try again later.
Articles 1–20