Carsten Baum

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 69

Top Topics

Privacy Preserving

Crossword Puzzles

Secure Multiparty Computation

Top Venues

IACR Cryptol. ePrint Arch.

Public Key Cryptography (1)

Publications

Carsten Baum, Jens Berlips, Walther Chen, Hongrui Cui, Ivan Damgård, Jiangbin Dong, Kevin M. Esvelt, Mingyu Gao, Dana Gretton, Leonard Foner, Martin Kysel, Kaiyi Zhang, Juanru Li, Xiang Li, Omer Paneth, Ronald L. Rivest, Francesca Sage-Ling, Adi Shamir, Yue Shen, Meicen Sun, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Yun Wang, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu, Haoling Zhang
A system capable of verifiably and privately screening global DNA synthesis. CoRR (2024)
Carsten Baum, Nikolas Melissaris, Rahul Rachuri, Peter Scholl
Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. CRYPTO (8) (2024)
Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl
One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. IACR Cryptol. ePrint Arch. 2024 (2024)
Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions. CCS (2023)
Carsten Baum, Bernardo David, Elena Pagnin, Akira Takahashi
CaSCaDE: (Time-Based) Cryptography from Space Communications DElay. IACR Cryptol. ePrint Arch. 2023 (2023)
Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head. IACR Cryptol. ePrint Arch. 2023 (2023)
Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen
SoK: Privacy-Enhancing Technologies in Finance. AFT (2023)
Carsten Baum, Nikolas Melissaris, Rahul Rachuri, Peter Scholl
Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. IACR Cryptol. ePrint Arch. 2023 (2023)
Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen
Eagle: Efficient Privacy Preserving Smart Contracts. FC (1) (2023)
Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen
SoK: Privacy-Enhancing Technologies in Finance. IACR Cryptol. ePrint Arch. 2023 (2023)
Carsten Baum, Samuel Dittmer, Peter Scholl, Xiao Wang
Sok: vector OLE-based zero-knowledge protocols. Des. Codes Cryptogr. 91 (11) (2023)
Carsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner
CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. Public Key Cryptography (1) (2023)
Carsten Baum, Samuel Dittmer, Peter Scholl, Xiao Wang
SoK: Vector OLE-Based Zero-Knowledge Protocols. IACR Cryptol. ePrint Arch. 2023 (2023)
Carsten Baum, Bernardo David, Rafael Dowsley
(Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge. ProvSec (2022)
Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. CRYPTO (5) (2022)
Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2022 (2022)
Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl
Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$. CRYPTO (4) (2022)
Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions. IACR Cryptol. ePrint Arch. 2022 (2022)
Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. CCS (2022)
Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen, Lorenzo Gentile
SoK: Mitigation of Front-Running in Decentralized Finance. Financial Cryptography Workshops (2022)
Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl
. IACR Cryptol. ePrint Arch. 2022 (2022)
Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza
Efficient protocols for oblivious linear function evaluation from ring-LWE. J. Comput. Secur. 30 (1) (2022)
Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen
Eagle: Efficient Privacy Preserving Smart Contracts. IACR Cryptol. ePrint Arch. 2022 (2022)
Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde, Thor Tunge
Lattice-Based Proof of Shuffle and Applications to Electronic Voting. IACR Cryptol. ePrint Arch. 2021 (2021)
Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Benoît Razet, Peter Scholl
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. CCS (2021)
Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha
Banquet: Short and Fast Signatures from AES. IACR Cryptol. ePrint Arch. 2021 (2021)
Shahar Segal, Yossi Adi, Benny Pinkas, Carsten Baum, Chaya Ganesh, Joseph Keshet
Fairness in the Eyes of the Data: Certifying Machine-Learning Models. AIES (2021)
Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen, Lorenzo Gentile
SoK: Mitigation of Front-running in Decentralized Finance. IACR Cryptol. ePrint Arch. 2021 (2021)
Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner
TARDIS: A Foundation of Time-Lock Puzzles in UC. EUROCRYPT (3) (2021)
Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl
. IACR Cryptol. ePrint Arch. 2021 (2021)
Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl
Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. CRYPTO (4) (2021)
Carsten Baum, Bernardo David, Tore Kasper Frederiksen
P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. ACNS (1) (2021)
Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha
Banquet: Short and Fast Signatures from AES. Public Key Cryptography (1) (2021)
Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde, Thor Tunge
Lattice-Based Proof of Shuffle and Applications to Electronic Voting. CT-RSA (2021)
Carsten Baum, Bernardo David, Tore Kasper Frederiksen
P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. IACR Cryptol. ePrint Arch. 2021 (2021)
Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions. IACR Cryptol. ePrint Arch. 2020 (2020)
Carsten Baum, Ariel Nof
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. Public Key Cryptography (1) (2020)
Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE. IACR Cryptol. ePrint Arch. 2020 (2020)
Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. IACR Cryptol. ePrint Arch. 2020 (2020)
Carsten Baum, Bernardo David, Rafael Dowsley
A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2020 (2020)
Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner
TARDIS: Time And Relative Delays In Simulation. IACR Cryptol. ePrint Arch. 2020 (2020)
Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. CRYPTO (2) (2020)
Shahar Segal, Yossi Adi, Benny Pinkas, Carsten Baum, Chaya Ganesh, Joseph Keshet
Fairness in the Eyes of the Data: Certifying Machine-Learning Models. CoRR (2020)
Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner
CRAFT: Composable Randomness and Almost Fairness from Time. IACR Cryptol. ePrint Arch. 2020 (2020)
Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE. SCN (2020)
Carsten Baum, Tore Kasper Frederiksen, Julia Hesse, Anja Lehmann, Avishay Yanai
PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server. EuroS&P (2020)
Carsten Baum, Bernardo David, Rafael Dowsley
Insured MPC: Efficient Secure Computation with Financial Penalties. Financial Cryptography (2020)
Carsten Baum, Daniele Cozzo, Nigel P. Smart
Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ. IACR Cryptol. ePrint Arch. 2019 (2019)
Carsten Baum, Daniele Cozzo, Nigel P. Smart
Using TopGear in Overdrive: A More Efficient ZKPoK for SPDZ. SAC (2019)
Carsten Baum, Ariel Nof
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. IACR Cryptol. ePrint Arch. 2019 (2019)
Carsten Baum, Tore Kasper Frederiksen, Julia Hesse, Anja Lehmann, Avishay Yanai
PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server. IACR Cryptol. ePrint Arch. 2019 (2019)
Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël Del Pino, Jens Groth, Vadim Lyubashevsky
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2018 (2018)
Carsten Baum, Huang Lin, Sabine Oechsner
Towards Practical Lattice-Based One-Time Linkable Ring Signatures. ICICS (2018)
Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël del Pino, Jens Groth, Vadim Lyubashevsky
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. CRYPTO (2) (2018)
Yossi Adi, Carsten Baum, Moustapha Cissé, Benny Pinkas, Joseph Keshet
Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring. USENIX Security Symposium (2018)
Carsten Baum, Ivan Damgård, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert
More Efficient Commitments from Structured Lattice Assumptions. SCN (2018)
Carsten Baum, Huang Lin, Sabine Oechsner
Towards Practical Lattice-Based One-Time Linkable Ring Signatures. IACR Cryptol. ePrint Arch. 2018 (2018)
Yossi Adi, Carsten Baum, Moustapha Cissé, Benny Pinkas, Joseph Keshet
Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring. CoRR (2018)
Carsten Baum, Bernardo David, Rafael Dowsley
Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort. IACR Cryptol. ePrint Arch. 2018 (2018)
Carsten Baum, Vadim Lyubashevsky
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. IACR Cryptol. ePrint Arch. 2017 (2017)
Carsten Baum
On Garbling Schemes with and Without Privacy. SCN (2016)
Carsten Baum, Emmanuela Orsini, Peter Scholl
Efficient Secure Multiparty Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2016 (2016)
Carsten Baum, Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias
Better Preprocessing for Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2016 (2016)
Carsten Baum, Ivan Damgård, Kasper Green Larsen, Michael Nielsen
How to Prove Knowledge of Small Secrets. CRYPTO (3) (2016)
Carsten Baum
On Garbling Schemes With And Without Privacy. IACR Cryptol. ePrint Arch. 2016 (2016)
Carsten Baum, Ivan Damgård, Kasper Green Larsen, Michael Nielsen
How to prove knowledge of small secrets. IACR Cryptol. ePrint Arch. 2016 (2016)
Carsten Baum, Ivan Damgård, Sabine Oechsner, Chris Peikert
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems. IACR Cryptol. ePrint Arch. 2016 (2016)
Carsten Baum, Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias
Better Preprocessing for Secure Multiparty Computation. ACNS (2016)
Carsten Baum, Emmanuela Orsini, Peter Scholl
Efficient Secure Multiparty Computation with Identifiable Abort. TCC (B1) (2016)
Carsten Baum, Ivan Damgård, Claudio Orlandi
Publicly Auditable Secure Multi-Party Computation. SCN (2014)
Carsten Baum, Ivan Damgård, Claudio Orlandi
Publicly Auditable Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2014 (2014)