Are you a researcher based in the USA 🇺🇸 or Canada 🇨🇦 interested in pursuing curiosity-driven research in Europe? Join the ERC and Euraxess for a webinar exploring ERC funding opportunities. 👇️ 📅 20 May 2026 🕚 11:30 AM ET | 8:30 AM PT 💻 Online Find out more and register:

Shafi Goldwasser (left), Silvio Micali (right), and Charles Rackoff devised a way to prove that a statement is true without revealing anything about why. www.quantamagazine.org/how-unknowab...

(Shahla - ex-student)

eprint has limited the rate for eprint requests for Eurocrypt participants. Serves us well, we should take it as a vacation week :-) Too Many Requests The user has sent too many requests in a given amount of time. Apache/2.4.67 Server at eprint.iacr.org Port 443

Helsinki Algorithms & Theory Days coming on August 27–28, 2026! algorithms.fi

I taught my last lecture/class today, of my first class ever taught outside of the United States (in Paris). It was very interesting to see how US and European (particularly French, but I gather broader than France) expectations were for how classes operate at the university level.

Two weeks ago, Google published a paper proving in zero-knowledge that they had an efficient implementation of Shor's algorithm. Today, Trail of Bits can prove that we have an even better implementation which beats Google's on all metrics! 🫢 blog.trailofbits.com/2026/04/17/w...

I am trying to understand the cryptographic protocols used by the EU age verification app - and currently I am failing. Is anyone able to extract how the age verification is supposed to work on a cryptographic level? Sec. 3.4 describes issuing and presentation of attestations, but ...

Sadly, it appears Michael Rabin passed away on April 14. Among other achievements, Rabin received the Turing Award with Dana Scott in 1976 for their paper "Finite Automata and Their Decision Problems", a highly influential work in automata theory. www.haaretz-evel.co.il/%D7%9E%D7%99...

Overdue quantum landscape update: sam-jaques.appspot.com/quantum_land... A 2d chart can only say so much. tl;dr new results are still overhyped, but definitely worth taking seriously. This chart is based on surface codes and a big question now is whether new codes can be practical (=>useless chart)

Open Problems in List Decoding and Correlated Agreement (Gal Arnon, Dan Boneh, Giacomo Fenzi) ia.cr/2026/680

(Solved) Gödel's Loophole is an "inner contradiction" in the Constitution of the US which Gödel postulated in 1947. The loophole would permit US to be legally turned into a dictatorship. It has been called "one of the great unsolved problems of constitutional law" en.wikipedia.org/wiki/G%C3%B6...

This year we are cooked - PKC, Crypto, TCC are in the USA, STOC and FOCS in the US, COLT in the US, Asiacrypt is in the Hong Kong (I prefer to go to the HK). Alternatives? CCC in Lisbon and CCS in The Hague

I already posted earlier links, here's a very timely quanta summary! www.quantamagazine.org/new-advances...

"A child offloading a task they've never learned to perform is not making a choice. They're skipping a developmental step that was never developed. The capacity doesn't exist yet. The foreclosure may be permanent—and [b/c] they have no independent baseline, they cannot recognize what they're losing"

A very nice explainer why "if you're so worried about quantum computers, why haven't they factored 21 yet?" isn't a very convincing argument. Look at the labels of the graph, and how extremely close the various lines are for factoring 21 and 2048 bit numbers. Polynomial scaling remains […]

...we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. ... the runtime for discrete logarithms on the P-256 elliptic curve could be just a few days for a system with 26,000 physical qubits, arxiv.org/abs/2603.28627

> We demonstrate that Shor’s algorithm...can execute with either ≤ 1200 logical qubits and ≤ 90 million Toffoli gates or ≤ 1450 logical qubits and ≤ 70 million Toffoli gates research.google/blog/safegua... quantumai.google/static/site-...

4색 정리 새로운 증명이 arXiv에 올라왔습니다. New proof of the four color theorem by Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, Mikkel Thorup arxiv.org/abs/2603.24880

Some first-rate science writing: For this story, @jdrakephd.bsky.social carefully read our recent paper and then we spent a very fun 90 minutes or so talking on zoom. His article that gets right to the heart of our model, explains it clearly, and then explores why it will matter in the future.

a petition cites the recent American military actions in Venezuela and Iran, the suspension of visas from 75 countries and the continued presence of federal ICE agents across major U.S. cities as contrary to the ICM’s goal of fostering “a sense of international unity amongst mathematicians.”

The German mathematician Gerd Faltings is the winner of this year's Abel Prize, an honor that is regarded as mathematics’ version of the Nobel Prize. He proved a conjecture that had been unsolved for six decades, using connections between numbers and geometry.

Well, this seems like a big deal. arxiv.org/abs/2603.087... "This is the first algorithm that can PAC learn even intersections of two halfspaces in time 2^o(n)."

Our group in Tartu (me, @jannosiim , Roberto Parisella etc) have an opening for up to 3 positions (postdoc or PhD) in ZK. See the link below for more information crypto.cs.ut.ee/Main/ZKPosit...

Pkc 2026 paper by @jannosiim.bsky.social (group member)

Our group in Tartu will have several new PhD positions this year. The first one on the web is this (Lattice-based cryptography, supervised by Maiara Bollauf) sites.google.com/view/maiarab...

Consider attending our CASA summer school on cryptography and distributed computing from June 22.-25. in Bochum! Registration is open until March 12. casa.rub.de/en/events/ca...

What a Wonderful World: zkSNARKs in the Algebraic Group Model are Universally Composable (Gaspard Anthoine, Dario Fiore, Mahak Pancholi) ia.cr/2026/399

Cyclo: Lightweight Lattice-based Folding via Partial Range Checks (Albert Garreta, Helger Lipmaa, Urmas Luhaäär, Michał Osadnik) ia.cr/2026/359

Fantastic post by Colin Raffel, "We Are Over-Indexing on Paper Acceptance," drafted in May 2021 (!) but only posted now. The more things change.. Last sentence: "If you want to judge a researcher’s quality, the only meaningful way is to read their papers and judge for yourself."

Second Eurocrypt paper Cyclo: Lightweight Lattice-based Folding via Partial Range Checks (Garreta, Lipmaa, Luhaäär, Osadnik) eprint.iacr.org/2026/359

Eurocrypt 2026 paper with (ex)students Erki Külaots, Roberto Parisella, @jannosiim.bsky.social : eprint.iacr.org/2026/326 Special Soundness and Binding Properties: A Framework for Tightly Secure zk-SNARKs

📢📢📢 𝐌𝐚𝐆𝐈𝐂 𝟐𝟎𝟐𝟔 𝐌𝐚𝐫𝐜𝐡𝐞 𝐖𝐨𝐫𝐤𝐬𝐡𝐨𝐩 𝐨𝐧 𝐆𝐫𝐨𝐮𝐩 𝐀𝐜𝐭𝐢𝐨𝐧𝐬 𝐢𝐧 𝐂𝐫𝐲𝐩𝐭𝐨𝐠𝐫𝐚𝐩𝐡𝐲 In May 5-8, let's all gather together to speak about Group Actions! Early registration until March 8! Organized with Marco Baldi, @bsky.defeo.lu, @giacomoborin.bsky.social, @andreavbasso.bsky.social magic-workshop.github.io

Eurocrypt += 2 One paper with and Erki Külaots PhD student) Roberto Parisella, @jannosiim.bsky.social (all from Tartu) Another one with Albert Garrett (Nethermind), Urmas Luhaäär (PhD student, Tartu) and Michal Osadnik (Aalto) Will post more when ready for e-printing

Call for submissions: #TPMPC2026 (Theory & Practice of MPC) Submit your latest and coolest results by March 2, 2026. Aarhus, Denmark, May 18–22, 2026. Monday: MPC security in practice. Friday: Symposium celebrating Ivan Damgård’s work. Links in comments.

On using LLMs for research (beyond basic prompts). Section 3.2 is specifically about catching a bug in a recent SNARG paper arxiv.org/abs/2602.03837

#QIP2026 is coming to Riga in less than a week! Very excited to find my university (pictured) at the epicenter of a global academic event. PSA: Pack some *really* warm clothing - we've got a real winter this time ❄️

By an ex student (Behzad)

New ICORE conference rankings are out. Theory, logic and formal methods seem to have been heavily penalised. I vibe coded an analysis of, for each Field of Research (FOR), how many associated venues increased or decreased in rank. Here's the summary. FOR 4613 had 13 venues decrease their rank! 1/2

What is wild to me is the defense, BY THE NEURIPS BOARD, that fabricated citations do not mean "the content of the papers themselves [is] necessarily invalidated" It does. It very much does. What do you think citing other work is for? What do you think writing a paper is for? What do you *think*?

In 1943, Norwegian author Knut Hamsun gave his Nobel Prize to Joseph Goebbels. So history _does_ repeat itself.

that's an interesting experiment (as a cryptographer, i am of course worried by adversarial authors)

This sounds really cool

New year, new pairing

Super exciting work from Ziyi and Eylon! They construct the first SNARG for NP in the *plain* model (no random oracle) using *only* (subexponential) LWE! Perhaps most surprisingly, the SNARG is one (very clever) instantiation of the classical Killian-Micali construction!

It was a big year for mathematics. youtu.be/hRpcWpAeWng

Your quarterly reminder to submit a paper to Communications in Cryptology... cic.iacr.org It is Diamond Open Access (readers and authors do not pay) and it contains all your new cool cryptographic research. Next deadline for submission is Feb 2nd.

If you swap each letter in “bomb” with the next letter in the alphabet, you’ll get “cpnc.” Recently, scientists showed that and other methods can bypass filters on LLMs like Gemini, DeepSeek and Grok. @peterha2l.bsky.social reports: www.quantamagazine.org/cryptographe...

SVP_(p) is Deterministically NP-Hard for all p > 2, Even to Approximate Within a Factor of 2^(log^(1 − ε)n) (Isaac M Hair, Amit Sahai) ia.cr/2025/2181