Carsten Baum
Carsten Baum
Assistant Professor, Aarhus University
Verifierad e-postadress på cs.au.dk - Startsida
Titel
Citeras av
Citeras av
År
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
1822018
Publicly auditable secure multi-party computation
C Baum, I Damgård, C Orlandi
International Conference on Security and Cryptography for Networks, 175-196, 2014
952014
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
81*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
542018
Towards Practical Lattice-Based One-Time Linkable Ring Signatures
C Baum, H Lin, S Oechsner
362018
How to prove knowledge of small secrets
C Baum, I Damgård, KG Larsen, M Nielsen
Annual International Cryptology Conference, 478-498, 2016
312016
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography.
C Baum, A Nof
Public Key Cryptography (1) 12110, 495-526, 2020
262020
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
242016
Efficient secure multiparty computation with identifiable abort
C Baum, E Orsini, P Scholl
Theory of Cryptography Conference, 461-490, 2016
172016
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
15*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
152019
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings.
C Baum, V Lyubashevsky
IACR Cryptol. ePrint Arch. 2017, 759, 2017
132017
On garbling schemes with and without privacy
C Baum
International Conference on Security and Cryptography for Networks, 468-485, 2016
112016
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions.
C Baum, AJ Malozemoff, MB Rosen, P Scholl
IACR Cryptol. ePrint Arch. 2020, 1410, 2020
92020
Banquet: Short and Fast Signatures from AES.
C Baum, CD de Saint Guilhem, D Kales, E Orsini, P Scholl, G Zaverucha
Public Key Cryptography (1), 266-297, 2021
72021
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
72020
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
62020
TARDIS: Time And Relative Delays In Simulation.
C Baum, B David, R Dowsley, JB Nielsen, S Oechsner
IACR Cryptol. ePrint Arch. 2020, 537, 2020
6*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
52020
A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols.
C Baum, B David, R Dowsley
IACR Cryptol. ePrint Arch. 2020, 207, 2020
32020
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20