Carsten Baum
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Carsten Baum has a total of 110 co-authors. Here are the top co-authors by number of shared publications:
- Peter Scholl
Aarhus University, Aarhus, Denmark
8 shared publications - Bernardo David
IT University of Copenhagen
4 shared publications - Bernardo David
IT University of Copenhagen
4 shared publications - Emmanuela Orsini
Bocconi University
4 shared publications Peter Scholl
Aarhus University
4 shared publications- Elena Pagnin
Chalmers University of Technology
3 shared publications
Latest Publications
- Open Access
- 26 October 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
Robust ECDSA Threshold Signing at Scale
This work presents an efficient, scalable, and robust threshold ECDSA signing protocol for the honest super-majority scenario, making it suitable for e.g., bridging consensus from one Blockchain to another. Our construction allows to batch-compute pre-processing material for efficient online signing. While our protocol is based on established ideas for (Verifiable) Secret Sharing, we optimize it to scale efficiently both in terms of computation and communication with a large number of signers. We therefore combine efficient batching techniques for sharing (Fitzi & Hirt, PODC 2006), randomness extraction (Beerliova-Trubiniova & Hirt, TCC 2008) and share opening (Damgård & Nielsen, CRYPTO 2007) with recent advances in efficient Zero-Knowledge proofs (Attema & Cramer, CRYPTO 2020). We implement and evaluate the protocol experimentally and show that it is practical for large number of parties.
- 26 October 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
Open AccessRobust ECDSA Threshold Signing at Scale
This work presents an efficient, scalable, and robust threshold ECDSA signing protocol for the honest super-majority scenario, making it suitable for e.g., bridging consensus from one Blockchain to another. Our construction allows to batch-compute pre-processing material for efficient online signing. While our protocol is based on established ideas for (Verifiable) Secret Sharing, we optimize it to scale efficiently both in terms of computation and communication with a large number of signers. We therefore combine efficient batching techniques for sharing (Fitzi & Hirt, PODC 2006), randomness extraction (Beerliova-Trubiniova & Hirt, TCC 2008) and share opening (Damgård & Nielsen, CRYPTO 2007) with recent advances in efficient Zero-Knowledge proofs (Attema & Cramer, CRYPTO 2020). We implement and evaluate the protocol experimentally and show that it is practical for large number of parties.
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 124-156
Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures
- 17 August 2025
- Published by Springer Nature
- p. 124-156
Open AccessShorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures
- Open Access
- 30 July 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (5) , 1287-1321
Proofs of sequential communication delays from physical assumptions and their applications
Time-based cryptographic primitives unlock efficient realizations of several functionalities including Randomness Beacons, Proof of Replicated Storage, Encryption to the Future, and MultiParty Computation with partial fairness. Existing constructions derive time-delays from the average hardness of sequential computational problems, a measure that is susceptible to algorithmic and hardware improvements. Therefore time-based systems secure at deployment date are at constant risk to turn insecure. A way to combat this intrinsic drawback is to ground time-delays on assumptions that are not affected by scientific advancement such as trust (in a subset of parties) and physical communication delays. This paper builds on Baum et al.’s (SCN 2024) work on “CaSCaDE: (Time-Based) Cryptography from Space Communications DElay”, and provides concrete realizations and detailed security proofs of: a Time Lock Puzzle, a stateless Verifiable Random Function, a Delay Encryption scheme, and a Randomness Beacon from proofs of Sequential Communication Delays (SCD) and trust assumptions on subsets of parties. Notably, our SCD-based Delay Encryption construction constitutes the first alternative to existing supersingular isogenies Delay Encryption schemes.
- 30 July 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (5) , 1287-1321
Open AccessProofs of sequential communication delays from physical assumptions and their applications
Time-based cryptographic primitives unlock efficient realizations of several functionalities including Randomness Beacons, Proof of Replicated Storage, Encryption to the Future, and MultiParty Computation with partial fairness. Existing constructions derive time-delays from the average hardness of sequential computational problems, a measure that is susceptible to algorithmic and hardware improvements. Therefore time-based systems secure at deployment date are at constant risk to turn insecure. A way to combat this intrinsic drawback is to ground time-delays on assumptions that are not affected by scientific advancement such as trust (in a subset of parties) and physical communication delays. This paper builds on Baum et al.’s (SCN 2024) work on “CaSCaDE: (Time-Based) Cryptography from Space Communications DElay”, and provides concrete realizations and detailed security proofs of: a Time Lock Puzzle, a stateless Verifiable Random Function, a Delay Encryption scheme, and a Randomness Beacon from proofs of Sequential Communication Delays (SCD) and trust assumptions on subsets of parties. Notably, our SCD-based Delay Encryption construction constitutes the first alternative to existing supersingular isogenies Delay Encryption schemes.
- 5 May 2025
- Published by Springer Nature
- p. 3-31
Universally Composable Interactive and Ordered Multi-signatures
- 5 May 2025
- Published by Springer Nature
- p. 3-31
Universally Composable Interactive and Ordered Multi-signatures
- 27 April 2025
- Published by Springer Nature
- p. 396-426
Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs
- 27 April 2025
- Published by Springer Nature
- p. 396-426
Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs
- 10 December 2024
- Published by Springer Nature
- p. 463-493
One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures
- 10 December 2024
- Published by Springer Nature
- p. 463-493
One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures
- Open Access
- 7 October 2024
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (3)
Efficient Maliciously Secure Oblivious Exponentiations
Oblivious Pseudorandom Functions (OPRFs) allow a client to evaluate a pseudorandom function (PRF) on her secret input based on a key that is held by a server. In the process, the client only learns the PRF output but not the key, while the server neither learns the input nor the output of the client. The arguably most popular OPRF is due to Naor, Pinkas and Reingold (Eurocrypt 2009). It is based on an Oblivious Exponentiation by the server, with passive security under the Decisional Diffie-Hellman assumption. In this work, we strengthen the security guarantees of the NPR OPRF by protecting it against active attacks of the server. We have implemented our solution and report on the performance. Our main result is a new batch OPRF protocol which is secure against maliciously corrupted servers, but is essentially as efficient as the semi-honest solution. More precisely, the computation (and communication) overhead is a multiplicative factor o ( 1 ) as the batch size increases. The obvious solution using zero-knowledge proofs would have a constant factor overhead at best, which can be too expensive for certain deployments. Our protocol relies on a novel version of the DDH problem, which we call the Oblivious Exponentiation Problem (OEP), and we give evidence for its hardness in the Generic Group model. We also present a variant of our maliciously secure protocol that does not rely on the OEP but nevertheless only has overhead o ( 1 ) over the known semi-honest protocol. Moreover, we show that our techniques can also be used to efficiently protect threshold blind BLS signing and threshold ElGamal decryption against malicious attackers.
- 7 October 2024
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (3)
Open AccessEfficient Maliciously Secure Oblivious Exponentiations
Oblivious Pseudorandom Functions (OPRFs) allow a client to evaluate a pseudorandom function (PRF) on her secret input based on a key that is held by a server. In the process, the client only learns the PRF output but not the key, while the server neither learns the input nor the output of the client. The arguably most popular OPRF is due to Naor, Pinkas and Reingold (Eurocrypt 2009). It is based on an Oblivious Exponentiation by the server, with passive security under the Decisional Diffie-Hellman assumption. In this work, we strengthen the security guarantees of the NPR OPRF by protecting it against active attacks of the server. We have implemented our solution and report on the performance. Our main result is a new batch OPRF protocol which is secure against maliciously corrupted servers, but is essentially as efficient as the semi-honest solution. More precisely, the computation (and communication) overhead is a multiplicative factor o ( 1 ) as the batch size increases. The obvious solution using zero-knowledge proofs would have a constant factor overhead at best, which can be too expensive for certain deployments. Our protocol relies on a novel version of the DDH problem, which we call the Oblivious Exponentiation Problem (OEP), and we give evidence for its hardness in the Generic Group model. We also present a variant of our maliciously secure protocol that does not rely on the OEP but nevertheless only has overhead o ( 1 ) over the known semi-honest protocol. Moreover, we show that our techniques can also be used to efficiently protect threshold blind BLS signing and threshold ElGamal decryption against malicious attackers.
- 10 September 2024
- Published by Springer Nature
- p. 252-274
CaSCaDE: (Time-Based) Cryptography from Space Communications DElay
- 10 September 2024
- Published by Springer Nature
- p. 252-274
CaSCaDE: (Time-Based) Cryptography from Space Communications DElay
- 16 August 2024
- Published by Springer Nature
- p. 454-488
Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs
- 16 August 2024
- Published by Springer Nature
- p. 454-488
Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs
- Open Access
Exact-match search with functional variant prediction enables automated DNA screening
Custom DNA synthesis underpins modern biology, but hazardous genes in the wrong hands could threaten many lives and public trust in science. In 1992, a virology-trained mass murderer tried and failed to obtain physical samples of Ebola; today, viruses can be assembled from synthetic DNA fragments. Screening orders for hazards is unreliable and expensive because similarity search algorithms yield false alarms requiring expert human review. Here we develop “random adversarial threshold” (RAT) search, which looks for exact matches to short nucleic acid and peptide subsequence windows from hazards and predicted functional variants that aren’t found in any known innocuous genes. To experimentally assess sensitivity, we used RAT search to protect nine windows from the M13 bacteriophage virus, then invited a “red team” to launch up to 21,000 attacks at each window and measure the fitness of their designed mutants. We identified defensible windows from regulated pathogens, built a curated test database that our M13 experiments indicate will block 99.999% of functional attacks, and verified its sensitivity against orders designed to evade detection. RAT search offers a way to safeguard biotechnology by securely automating DNA synthesis screening. Summary Searching for exact matches to pre-computed functional variants unique to hazardous genes enables sensitive, secure, and automated DNA synthesis screening.
Open AccessExact-match search with functional variant prediction enables automated DNA screening
Custom DNA synthesis underpins modern biology, but hazardous genes in the wrong hands could threaten many lives and public trust in science. In 1992, a virology-trained mass murderer tried and failed to obtain physical samples of Ebola; today, viruses can be assembled from synthetic DNA fragments. Screening orders for hazards is unreliable and expensive because similarity search algorithms yield false alarms requiring expert human review. Here we develop “random adversarial threshold” (RAT) search, which looks for exact matches to short nucleic acid and peptide subsequence windows from hazards and predicted functional variants that aren’t found in any known innocuous genes. To experimentally assess sensitivity, we used RAT search to protect nine windows from the M13 bacteriophage virus, then invited a “red team” to launch up to 21,000 attacks at each window and measure the fitness of their designed mutants. We identified defensible windows from regulated pathogens, built a curated test database that our M13 experiments indicate will block 99.999% of functional attacks, and verified its sensitivity against orders designed to evade detection. RAT search offers a way to safeguard biotechnology by securely automating DNA synthesis screening. Summary Searching for exact matches to pre-computed functional variants unique to hazardous genes enables sensitive, secure, and automated DNA synthesis screening.