Next up, 'Encryption in the microarchitectural world', presented by Ping-Lun Wang
#realworldcrypto
09.03.2026 09:49
👍 3
🔁 1
💬 1
📌 0
Next up, 'Encryption in the microarchitectural world', presented by Ping-Lun Wang
#realworldcrypto
Very proud and grateful to have won the 2026 #realworldcrypto Levchin prize together with David Basin, Jannik Dreier, and Ralf Sasse for our work on the Tamarin Prover (tamarin-prover.com), as well as having the amazing opportunity to give a keynote at RWC! Hope you enjoyed it! #realworldcrypto2026
Huge congrats to the Tamarin Team on winning the Levchin Prize for the Tamarin prover, and its use in the analysis of real-world security protocols. #realworldcrypto2026
The data from your Meta Ray Bans is used to train Meta's AI, which most people don't understand means that humans are looking at the most intimate details of their lives. www.svd.se/a/K8nrV4/met...
The Lebanese, Iranians, Israelis, and all the rest of the people in the Middle East deserve much better. I hope that we will be smart and strong enough to bring peace and prosperity to everyone here.
Until now, if you lost or broke your phone, your Signal message history was *gone,* a real challenge for everyone whose most important conversations happen in Signal. So, with careful design and development, we’re rolling out opt-in secure backups.
signal.org/blog/introducing-secure-backups
This battle will keep playing out over and over again until they achieve something that their own citizens have made it clear they don’t want. www.techradar.com/vpn/vpn-priv...
Well, this horrible idea refuses to die so we should refuse to let it pass and start organizing again.
ec.europa.eu/commission/p...
If any Iron Maiden fans are in the Birmingham area tomorrow (the 21st), I have a couple of Premier Lounge tickets that I unfortunately can't use due to the current situation.
#IronMaiden #RunForYourLivesWorldTour #IronMaiden50
@ironmaiden.bsky.social
New blog post on our (with @rikkebjerg.bsky.social and @mikaelabrough.bsky.social) USENIX'25 paper "On the Virtues of Information Security in the UK Climate Movement" where I end up reflecting on writing this, for me, unusual work.
martinralbrecht.wordpress.com/2025/06/14/o...
I think that papers paper award is better
After a long debate about whether this small typo was worth resubmitting the PDF or not, @IEEESSP 's server stopped responding one minute before the deadline and solved it for us.
All papers should publish their code. Help realize this by becoming an artifact reviewer at NDSS'26, apply here: docs.google.com/forms/d/e/1F...
You'll review artifacts of accepted papers. We especially encourage junior/senior PhD students & PostDocs to help. Distinguished reviews will get awards!
uASC 2026 will take place on February 3, 2026, in Leuven, Belgium, hosted by KU Leuven. We can't wait to see you next year!
Cycle 1 Paper Submission Deadline is July 15, 2025!
👉 uasc.cc #uasc26
New version of the IEEE 802.11 standard that underpins Wi-Fi was has been released. A total of 5969 pages!
The number of pages clearly keeps increasing. That includes more features to defend networks, but also more features to potentially abuse 👀
Bradley Morgan, Gal Horowitz, Sioli O'Connell, Stephan van Schaik, Chitchanok Chuengsatiansup, Daniel Genkin, Olaf Maennel, Paul Montague, Eyal Ronen, Yuval Yarom
Slice+Slice Baby: Generating Last-Level Cache Eviction Sets in the Blink of an Eye
https://arxiv.org/abs/2504.11208
Congratulations to the new IACR fellows....
Joan Daemen,
Thomas Johansson,
Anna Lysyanskaya,
Pascal Paillier,
J.R. Rao,
Alon Rosen,
Elaine Shi,
Bo-Yin Yang.
iacr.org/fellows/
#cryptography
Taking this trans day of visibility as a moment to say I am loudly and unapologetically in support of trans rights. 🏳️⚧️
If you’re a FOSS project dealing with overwhelming AI scraper bots, we will provide free security services for your project at no cost to you ❤️ #TeamSleep thelibre.news/foss-infrast...
Congratulations to the legendary Adi Shamir on his Levchin Prize win! Dr. Shamir donated the $10K prize money to students sponsorships.
Now we have Adi Shamir's invited talk on 'How to Securely Implement Cryptography in Deep Neural Networks'
eprint.iacr.org/2025/288.pdf
#realworldcrypto
In 25 years of covering national security, I’ve never seen a story like this: Senior Trump officials discussed planning for the U.S. attack on Yemen in a Signal group--and inadvertently added the editor-in-chief of The Atlantic. www.theatlantic.com/politics/arc...
*Friends don’t let friends deploy a cryptographic protocol without a formal cryptographic analysis* martinralbrecht.wordpress.com/2025/03/16/a... @kennyog.bsky.social @eyalr0.bsky.social @lenka.sh
It’s finally out - our 107-page analysis of key exchange in Telegram in which we proved (after massive effort) that the bespoke protocol is ok, if you’re willing to make some uncomfy assumptions on the home-grown KDF. With @malb.bsky.social, @eyalr0.bsky.social, Lenka Mareková and Igors Stepanovs.
The tentative program for Real World Crypto 2025 is live!
rwc.iacr.org/2025/program...
A huge thanks to my co-chair @malb.bsky.social and all the amazing program committee members for helping put this together. I'm looking forward to seeing everyone in Sofia!
#realworldcrypto
Well, I guess that privilege escalation is considered woke now.
Because of new tariffs, submissions to crypto with a non US author have a 20% reduction to their page limit.
The list of accepted talk at @rwc.iacr.org is now available: rwc.iacr.org/2025/accepte... Early registration ends 26 February. CC: programme co-chair @nicksullivan.org
Abstract. The Fiat-Shamir (FS) transform is a prolific and powerful technique for compiling public-coin interactive protocols into non-interactive ones. Roughly speaking, the idea is to replace the random coins of the verifier with the evaluations of a complex hash function. The FS transform is known to be sound in the random oracle model (i.e., when the hash function is modeled as a totally random function). However, when instantiating the random oracle using a concrete hash function, there are examples of protocols in which the transformation is not sound. So far all of these examples have been contrived protocols that were specifically designed to fail. In this work we show such an attack for a standard and popular interactive succinct argument, based on the GKR protocol, for verifying the correctness of a non-determinstic bounded-depth computation. For every choice of FS hash function, we show that a corresponding instantiation of this protocol, which was been widely studied in the literature and used also in practice, is not (adaptively) sound when compiled with the FS transform. Specifically, we construct an explicit circuit for which we can generate an accepting proof for a false statement. We further extend our attack and show that for every circuit C and desired output y, we can construct a functionally equivalent circuit C^(*), for which we can produce an accepting proof that C^(*) outputs y (regardless of whether or not this statement is true). This demonstrates that any security guarantee (if such exists) would have to depend on the specific implementation of the circuit C, rather than just its functionality. Lastly, we also demonstrate versions of the attack that violate non-adaptive soundness of the protocol – that is, we generate an attacking circuit that is independent of the underlying cryptographic objects. However, these versions are either less practical (as the attacking circuit has very large depth) or make some additional (reasonable) assumptions on the underlying cryptographic primitives.
Image showing part 2 of abstract.
How to Prove False Statements: Practical Attacks on Fiat-Shamir (Dmitry Khovratovich, Ron D. Rothblum, Lev Soukhanov) ia.cr/2025/118
