Publicly Auditable Secure Multi-Party Computation. - Carsten Baum; Ivan Damgård; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2014)

On Garbling Schemes With And Without Privacy. - Carsten Baum (IACR Cryptol. ePrint Arch., 2016)

How to prove knowledge of small secrets. - Carsten Baum; Ivan Damgård; Kasper Green Larsen; Michael Nielsen 001 (IACR Cryptol. ePrint Arch., 2016)

Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems. - Carsten Baum; Ivan Damgård; Sabine Oechsner; Chris Peikert (IACR Cryptol. ePrint Arch., 2016)

Better Preprocessing for Secure Multiparty Computation. - Carsten Baum; Ivan Damgård; Tomas Toft; Rasmus Winther Zakarias (IACR Cryptol. ePrint Arch., 2016)

Efficient Secure Multiparty Computation with Identifiable Abort. - Carsten Baum; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2016)

Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. - Carsten Baum; Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2017)

More Efficient Commitments from Structured Lattice Assumptions. - Carsten Baum; Ivan Damgård; Vadim Lyubashevsky; Sabine Oechsner; Chris Peikert (SCN, 2018)

Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring. - Yossi Adi; Carsten Baum; Moustapha Cissé; Benny Pinkas; Joseph Keshet (USENIX Security Symposium, 2018)

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. - Carsten Baum; Jonathan Bootle; Andrea Cerulli; Rafaël Del Pino; Jens Groth; Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2018)

Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort. - Carsten Baum; Bernardo David; Rafael Dowsley (IACR Cryptol. ePrint Arch., 2018)

Towards Practical Lattice-Based One-Time Linkable Ring Signatures. - Carsten Baum; Huang Lin; Sabine Oechsner (IACR Cryptol. ePrint Arch., 2018)

Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ. - Carsten Baum; Daniele Cozzo; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2019)

PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server. - Carsten Baum; Tore Kasper Frederiksen; Julia Hesse; Anja Lehmann; Avishay Yanai (IACR Cryptol. ePrint Arch., 2019)

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. - Carsten Baum; Ariel Nof (IACR Cryptol. ePrint Arch., 2019)

Insured MPC: Efficient Secure Computation with Financial Penalties. - Carsten Baum; Bernardo David; Rafael Dowsley (Financial Cryptography, 2020)

A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols. - Carsten Baum; Bernardo David; Rafael Dowsley (IACR Cryptol. ePrint Arch., 2020)

TARDIS: Time And Relative Delays In Simulation. - Carsten Baum; Bernardo David; Rafael Dowsley; Jesper Buus Nielsen; Sabine Oechsner (IACR Cryptol. ePrint Arch., 2020)

CRAFT: Composable Randomness and Almost Fairness from Time. - Carsten Baum; Bernardo David; Rafael Dowsley; Ravi Kishore; Jesper Buus Nielsen; Sabine Oechsner (IACR Cryptol. ePrint Arch., 2020)

Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions. - Carsten Baum; Alex J. Malozemoff; Marc B. Rosen; Peter Scholl (IACR Cryptol. ePrint Arch., 2020)

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. - Carsten Baum; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2020)

Fairness in the Eyes of the Data: Certifying Machine-Learning Models. - Shahar Segal; Yossi Adi; Benny Pinkas; Carsten Baum; Chaya Ganesh; Joseph Keshet (AIES, 2021)

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. - Carsten Baum; Lennart Braun; Alexander Munch-Hansen; Benoît Razet; Peter Scholl (CCS, 2021)

Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. - Carsten Baum; Alex J. Malozemoff; Marc B. Rosen; Peter Scholl (CRYPTO (4), 2021)

TARDIS: A Foundation of Time-Lock Puzzles in UC. - Carsten Baum; Bernardo David; Rafael Dowsley; Jesper Buus Nielsen; Sabine Oechsner (EUROCRYPT (3), 2021)

Lattice-Based Proof of Shuffle and Applications to Electronic Voting. - Diego F. Aranha; Carsten Baum; Kristian Gjøsteen; Tjerand Silde; Thor Tunge (IACR Cryptol. ePrint Arch., 2021)

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and ℤ2k. - Carsten Baum; Lennart Braun; Alexander Munch-Hansen; Peter Scholl (IACR Cryptol. ePrint Arch., 2021)

SoK: Mitigation of Front-running in Decentralized Finance. - Carsten Baum; James Hsin-yu Chiang; Bernardo David; Tore Kasper Frederiksen; Lorenzo Gentile (IACR Cryptol. ePrint Arch., 2021)

P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. - Carsten Baum; Bernardo David; Tore Kasper Frederiksen (IACR Cryptol. ePrint Arch., 2021)

Banquet: Short and Fast Signatures from AES. - Carsten Baum; Cyprien Delpech de Saint Guilhem; Daniel Kales; Emmanuela Orsini; Peter Scholl; Greg Zaverucha (IACR Cryptol. ePrint Arch., 2021)

Moz$ mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $ mathbb {Z}_{2^k}$. - Carsten Baum; Lennart Braun; Alexander Munch-Hansen; Peter Scholl (CRYPTO (4), 2022)

(Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge. - Carsten Baum; Bernardo David; Rafael Dowsley (ProvSec, 2022)

Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions. - Diego F. Aranha; Carsten Baum; Kristian Gjøsteen; Tjerand Silde (IACR Cryptol. ePrint Arch., 2022)

Mozℤ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs Over ℤ2k. - Carsten Baum; Lennart Braun; Alexander Munch-Hansen; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Eagle: Efficient Privacy Preserving Smart Contracts. - Carsten Baum; James Hsin-yu Chiang; Bernardo David; Tore Kasper Frederiksen (IACR Cryptol. ePrint Arch., 2022)

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. - Carsten Baum; Robin Jadoul; Emmanuela Orsini; Peter Scholl; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2022)

Efficient protocols for oblivious linear function evaluation from ring-LWE. - Carsten Baum; Daniel Escudero 001; Alberto Pedrouzo-Ulloa; Peter Scholl; Juan Ramón Troncoso-Pastoriza (J. Comput. Secur., 2022)

CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. - Carsten Baum; Bernardo David; Rafael Dowsley; Ravi Kishore; Jesper Buus Nielsen; Sabine Oechsner (Public Key Cryptography (1), 2023)

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head. - Carsten Baum; Lennart Braun; Cyprien Delpech de Saint Guilhem; Michael Klooß; Emmanuela Orsini; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

SoK: Privacy-Enhancing Technologies in Finance. - Carsten Baum; James Hsin-yu Chiang; Bernardo David; Tore Kasper Frederiksen (IACR Cryptol. ePrint Arch., 2023)

CaSCaDE: (Time-Based) Cryptography from Space Communications DElay. - Carsten Baum; Bernardo David; Elena Pagnin; Akira Takahashi 002 (IACR Cryptol. ePrint Arch., 2023)

Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. - Carsten Baum; Nikolas Melissaris; Rahul Rachuri; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

Sok: vector OLE-based zero-knowledge protocols. - Carsten Baum; Samuel Dittmer; Peter Scholl; Xiao Wang 012 (Des. Codes Cryptogr., 2023)

Efficient Maliciously Secure Oblivious Exponentiations. - Carsten Baum; Jens Berlips; Walther Chen; Ivan Bjerre Damgård; Kevin M. Esvelt; Leonard Foner; Dana Gretton; Martin Kysel; Ronald L. Rivest; Lawrence Roy; Francesca Sage-Ling; Adi Shamir; et al. (IACR Commun. Cryptol., 2024)

A system capable of verifiably and privately screening global DNA synthesis. - Carsten Baum; Jens Berlips; Walther Chen; Hongrui Cui; Ivan Damgård; Jiangbin Dong; Kevin M. Esvelt; Mingyu Gao 001; Dana Gretton; Leonard Foner; Martin Kysel; Kaiyi Zhang 001; et al. (CoRR, 2024)

One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. - Carsten Baum; Ward Beullens; Shibam Mukherjee; Emmanuela Orsini; Sebastian Ramacher; Christian Rechberger; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2024)

Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures. - Carsten Baum; Ward Beullens; Lennart Braun; Cyprien Delpech de Saint Guilhem; Michael Klooß; Christian Majenz; Shibam Mukherjee; Emmanuela Orsini; Sebastian Ramacher; Christian Rechberger; Lawrence Roy; Peter Scholl (CRYPTO (6), 2025)

Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs. - Amit Agarwal; Carsten Baum; Lennart Braun; Peter Scholl (EUROCRYPT (4), 2025)

Universally Composable Interactive and Ordered Multi-Signatures. - Carsten Baum; Bernardo David; Elena Pagnin; Akira Takahashi 002 (IACR Cryptol. ePrint Arch., 2025)