Carsten Baum

Orcid: 0000-0001-7905-0198

Affiliations:
  • Aarhus University, Department of Computer Science, Denmark (PhD)
  • Technical University of Denmark, Denmark
  • Bar-Ilan University, Ramat Gan, Israel


According to our database1, Carsten Baum authored at least 50 papers between 2014 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Proofs of sequential communication delays from physical assumptions and their applications.
Cryptogr. Commun., September, 2025

Universally Composable Interactive and Ordered Multi-signatures.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
A system capable of verifiably and privately screening global DNA synthesis.
CoRR, 2024

Efficient Maliciously Secure Oblivious Exponentiations.
IACR Commun. Cryptol., 2024

CaSCaDE: (Time-Based) Cryptography from Space Communications DElay.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
SoK: Vector OLE-Based Zero-Knowledge Protocols.
IACR Cryptol. ePrint Arch., 2023

CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Eagle: Efficient Privacy Preserving Smart Contracts.
Proceedings of the Financial Cryptography and Data Security, 2023

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

SoK: Privacy-Enhancing Technologies in Finance.
Proceedings of the 5th Conference on Advances in Financial Technologies, 2023

2022
Mozℤ<sub>2<sup>k</sup></sub>arella: Efficient Vector-OLE and Zero-Knowledge Proofs Over ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2022

(Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge.
Proceedings of the Provable and Practical Security, 2022

SoK: Mitigation of Front-Running in Decentralized Finance.
Proceedings of the Financial Cryptography and Data Security. FC 2022 International Workshops, 2022

Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2021

Banquet: Short and Fast Signatures from AES.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

TARDIS: A Foundation of Time-Lock Puzzles in UC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Lattice-Based Proof of Shuffle and Applications to Electronic Voting.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Fairness in the Eyes of the Data: Certifying Machine-Learning Models.
Proceedings of the AIES '21: AAAI/ACM Conference on AI, 2021

P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange.
Proceedings of the Applied Cryptography and Network Security, 2021

2020
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions.
IACR Cryptol. ePrint Arch., 2020

CRAFT: Composable Randomness and Almost Fairness from Time.
IACR Cryptol. ePrint Arch., 2020

TARDIS: Time And Relative Delays In Simulation.
IACR Cryptol. ePrint Arch., 2020

A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols.
IACR Cryptol. ePrint Arch., 2020

Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Insured MPC: Efficient Secure Computation with Financial Penalties.
Proceedings of the Financial Cryptography and Data Security, 2020

PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server.
Proceedings of the IEEE European Symposium on Security and Privacy, 2020

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Using TopGear in Overdrive: A More Efficient ZKPoK for SPDZ.
Proceedings of the Selected Areas in Cryptography - SAC 2019, 2019

2018
Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort.
IACR Cryptol. ePrint Arch., 2018

Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring.
Proceedings of the 27th USENIX Security Symposium, 2018

More Efficient Commitments from Structured Lattice Assumptions.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Towards Practical Lattice-Based One-Time Linkable Ring Signatures.
Proceedings of the Information and Communications Security - 20th International Conference, 2018

Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings.
IACR Cryptol. ePrint Arch., 2017

2016
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems.
IACR Cryptol. ePrint Arch., 2016

Efficient Secure Multiparty Computation with Identifiable Abort.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

On Garbling Schemes with and Without Privacy.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

How to Prove Knowledge of Small Secrets.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Better Preprocessing for Secure Multiparty Computation.
Proceedings of the Applied Cryptography and Network Security, 2016

2014
Publicly Auditable Secure Multi-Party Computation.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014


  Loading...