Carsten Baum
@cryptocarsten.bsky.social
290 followers 100 following 93 posts
Professor at DTU Compute. Passionate about Cryptography, Hummus and coffee.
Posts Media Videos Starter Packs
Reposted by Carsten Baum
cgravert.bsky.social
Denmark is best in EU in getting workers back into jobs (twice the average rate). They also do tons of RCTs to find out what works and apply behavior science. Can’t say it’s causal, but it’s an interesting correlation at least.
bentesorgenfrey.bsky.social
I 2024 var Danmark bedst i #EU til at få ledige i job. 40,8 pct. af de ledige i et givent kvartal, kom i job i det efterfølgende kvartal, hvilket er væsentligt over EU-gennemsnittet på 24,2 pct. Det er 14. år i træk, at Danmark er EU-mestre i at få ledige i job #dkpol www.ae.dk/analyse/2025...
Danmark er EU-mestre for 14. år i træk: Bedst til at få ledige i job
Gennemsnitligt 40,8 pct. af de ledige i et givent kvartal kom i job i det efterfølgende kvartal i 2024. Det er den højeste andel i EU – for 14. år i træk. Danmark er også bedst til at få langtidsledig...
www.ae.dk
cryptocarsten.bsky.social
SPD stabil an der Seite großindustrieller Gasproduzenten und nicht dem kleinen Mann.

Abbrennen den Laden, braucht niemand.
cryptocarsten.bsky.social
That one time you wish they'd have used ChatGPT
cryptocarsten.bsky.social
Submission link: easychair.org/my/conferenc...

Important dates:

The deadline for contributed talks is Sunday, June 15th, 2025

Notification will be sent out no later than Sunday, June 22nd, 2025
Log in to EasyChair for CRYPTO-PPML 2025
easychair.org
cryptocarsten.bsky.social
The program will consist of a few invited talks and contributed talks. We encourage submissions exploring a range of techniques for privacy-preserving machine learning.

Confirmed invited speakers & call for contributed talks: crypto-ppml.github.io/2025/
Privacy-Preserving Machine Learning Workshop 2025
crypto-ppml.github.io
cryptocarsten.bsky.social
The 7th workshop on Privacy Preserving Machine Learning will take place on August 17, 2025 (Sunday), as an affiliated event of the 45th CRYPTO 2025 conference.
Reposted by Carsten Baum
cryptocarsten.bsky.social
Kandidat für den Ignoble?
cryptocarsten.bsky.social
Nice work! Great that you cut through all the marketing :)
cryptocarsten.bsky.social
Oh wow, this is really great work. Recent results on PCGs allowed much more efficient MPC preprocessing (among other things) using somewhat new assumptions. Apparently, these assumptions are too strong.

Congratulations to the authors on their IACR grant slam of breaks :)
eprint.ing.bot
Practical cryptanalysis of pseudorandom correlation generators based on quasi-Abelian syndrome decoding (Charles Bouillaguet, Claire Delaplace, Mickaël Hamdad, Damien Vergnaud) ia.cr/2025/892
Abstract. Quasi-Abelian Syndrome Decoding (QA-SD) is a recently in- troduced generalization of Ring-LPN that uses multivariate polynomials rings. As opposed to Ring-LPN, it enables the use of small finite field such as GF(3) and GF(4). It was introduced by Bombar et al (Crypto 2023) in order to obtain pseudorandom correlation generators for Beaver triples over small fields. This theoretical work was turned into a concrete and efficient protocol called F4OLEage by Bombar et al. (Asiacrypt 2024) that allows several parties to generate Beaver triples over GF(2).

We propose efficient algorithms to solve the decoding problem underlying the QA-SD assumption. We observe that it reduce to a sparse multivariate polynomial interpolation problem over a small finite field where the adversary only has access to random evaluation points, a blind spot in the otherwise rich landscape of sparse multivariate interpolation. We develop new algorithms for this problem: using simple techniques we interpolate polynomials with up to two monomials. By sending the problem to the field of complex numbers and using convex optimization techniques inspired by the field of “compressed sensing”, we can interpolate polynomials with more terms.

This enables us to break in practice parameters proposed by Bombar et al. at Crypto’23 and Asiacrypt’24 as well as Li et al. at Eurocrypt’25 (IACR flagship conferences Grand Slam). In the case of the F4OLEage protocol, our implementation recovers all the secrets in a few hours with probability 60%. This not only invalidates the security proofs, but it yields real-life privacy attacks against multiparty protocols using the Beaver triples generated by the broken pseudorandom correlation generators.
Image showing part 2 of abstract.
cryptocarsten.bsky.social
Never thought I'd participate in making a whole scientific conference dance the Macarena.
Yet here we are.
Reposted by Carsten Baum
proofnerd.bsky.social
Our paper on attacking concurrent MPC implementations is finally on eprint 🎉
(And @schollster.bsky.social will present it at S&P 2025!)

A summary 🧵
eprint.ing.bot
Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations (Alexander Kyster, Frederik Huss Nielsen, Sabine Oechsner, Peter Scholl) ia.cr/2025/789
Abstract. Secure multi-party computation (MPC) enables parties to compute a function over private inputs while maintaining confidentiality. Although MPC has advanced significantly and attracts a growing industry interest, open-source implementations are still at an early stage, with no production-ready code and a poor understanding of their actual security guarantees. In this work, we study the real-world security of modern MPC implementations, focusing on the SPDZ protocol (Damgård et al., CRYPTO 2012, ESORICS 2013), which provides security against malicious adversaries when all-but-one of the participants may be corrupted. We identify a novel type of MAC key leakage in the MAC check protocol of SPDZ, which can be exploited in concurrent, multi-threaded settings, compromising output integrity and, in some cases, input privacy. In our analysis of three SPDZ implementations (MP-SPDZ, SCALE-MAMBA, and FRESCO), two are vulnerable to this attack, while we also uncover further issues and vulnerabilities with all implementations. We propose mitigation strategies and some recommendations for researchers, developers and users, which we hope can bring more awareness to these issues and avoid them reoccurring in future.
Image showing part 2 of abstract.
Reposted by Carsten Baum
cryptocarsten.bsky.social
It takes a certain academic age and amount of accomplishments that allows you to use Comic Sans AND get away with it.
cryptocarsten.bsky.social
Don't forget to submit your most hilarious talk, musical performance, general announcement or recent result to the Eurocrypt 2025 Rump Session!