Sign in

Tianxin Tang

@koptxin.bsky.social
56 followers 84 following 23 posts

Cryptography researcher Lab assistant at Muppets Lab txin.dev

PostsRepliesMedia
Reposted by Tianxin Tang
Randall Munroe @xkcd.com · 22/09/2026
Tyrannosaurus xkcd.com/3300/
Comic. [Person with long hair pointing to diagram with Tyrannosaurus Rex standing next to a person.] PERSON: We now believe the primary prey of Tyrannosaurus Rex was these humans who kept standing next to it for scale.
91121102095
Reposted by Tianxin Tang
Stefano Tessaro @stefanotessaro.bsky.social · 23/09/2026
New paper (ia.cr/2026/2126) with Àlex Rodríguez García. We give polynomial-time (!) adaptive attacks against a number of threshold Schnorr signatures. At the core are the first polynomial-time attacks on LDVR, a problem whose solution yields adaptive attacks on several practical schemes.
ia.cr
Cryptanalysis of LDVR: Polynomial-Time Adaptive Attacks against Threshold Schnorr Signatures
We present the first polynomial-time attacks against certain parameter choices of the low-dimensional vector representation (LDVR) problem, introduced by Crites, Katz, Komlo, Tessaro, and Zhu (CRYPTO ...
1103
Reposted by Tianxin Tang
Fredrik Dahlgren @fegge.bsky.social · 18/09/2026
Everyone and their mother is using AI to find bugs. We used AI to build static-analysis and formal verification tooling for Miden’s zkVM. The new linter found a signature validation bypass, and the formal verification work resulted in 95 correctness proofs. blog.trailofbits.com/2026/09/18/a...
blog.trailofbits.com
Auditing in the age of (good enough) AI
Before code review even starts, agents let us build custom tooling and formal models. Here’s how six months of building with AI agents helped us find real issues in our Miden zkVM audit.
142
Reposted by Tianxin Tang
Lance Fortnow @lance.fortnow.com · 17/09/2026
STOC call for papers is out. Deadline is November 2. acm-stoc.org/stoc202... New rules for the AI era: limited submissions, public posting and a required video. Is it a coincidence that the camera-ready deadline is April Fools Day?
0125
Reposted by Tianxin Tang
Shriram Krishnamurthi @shriram.bsky.social · 08/09/2026
Sorry, XKCD.
XKCD 435 Purity (https://xkcd.com/435/) with added OpenAI logo saying "Oh, hey, I didn't see you guys … but I did see your chats."
0388
Tianxin Tang @koptxin.bsky.social · 20/08/2026
dontpastetheai.com (currently struggling with this a lot with masters students...)
dontpastetheai.com
Don't paste the AI.
If someone asks you a question, paste your answer — not the chatbot's.
011
Tianxin Tang @koptxin.bsky.social · 20/08/2026
arxiv.org/abs/2608.16753 (Mathematics in the age of AI by Terence Tao)
arxiv.org
Mathematics in the age of AI
An essay, based on a public lecture delivered at the 2026 International Congress of Mathematicians, on how the mathematical community might respond to the arrival of artificial intelligence tools that...
020
Reposted by Tianxin Tang
Miro Haller @mirohaller.bsky.social · 10/08/2026
You can also register to attend WAC8--the workshop on attacks in cryptography, an affiliated event with Crypto 2026--remotely (for free). Just fill out this google form: forms.gle/1anNohNaJmtA...
forms.gle
WAC8 Remote Registration
Sign up with an email address to receive the Zoom link to attend the workshop on attacks in cryptography 8 (WAC8) remotely. All information about the workshop is on our website: https://wac8.cryptanal...
164
Reposted by Tianxin Tang
Ethan Mollick @emollick.bsky.social · 08/08/2026
You may have been told to watch this video about the OpenAI AI hack. You really should, even if you don't usually care about any tech stuff. If nothing else, click this link to the 18 minutes in & see how the agents spoke & coordinated with each other. Its eye opening. youtu.be/87DyyMV0kCY?...
youtu.be
Black Hat USA 2026: The 'Breaking' News: The OpenAI–Hugging Face Incident
YouTube video by Black Hat
1122951
Reposted by Tianxin Tang
Henry Yuen @henryyuen.bsky.social · 01/08/2026
Some initial thoughts, and a complicated mix of feelings. Wow. I mean, Erdos problems are cool (I genuinely mean that), I didn't know about the Jacobian conjecture before it got disproved. But this newest batch from OpenAI hits home in a way the previous announcements did not.
232972
Reposted by Tianxin Tang
Chris Peikert @chrispeikert.bsky.social · 28/07/2026
This is a very cool and exciting discovery by Claude Mythos! It found a serious 𝒎𝒂𝒕𝒉𝒆𝒎𝒂𝒕𝒊𝒄𝒂𝒍 attack on the post-quantum signature scheme HAWK, an "on-ramp" candidate for potential NIST standardization. www.anthropic.com/research/dis...
anthropic.com
Discovering cryptographic weaknesses with Claude
Anthropic researchers find weaknesses in cryptographic algorithms with Claude Mythos Preview
23218
Reposted by Tianxin Tang
Quanta Magazine @quantamagazine.org · 23/07/2026
Every four years, the math world’s preeminent awards are given to the finest minds of a generation. The young Fields and Abacus Medal winners — all under 40 on the first day of the year — have reshaped mathematics and theoretical computer science. Here are the #ICM2026 winners:
15224
Reposted by Tianxin Tang
mccurley.bsky.social @mccurley.bsky.social · 09/07/2026
The IACR board has put forward a proposal to revamp the publishing of the general conference proceedings for Eurocrypt, Crypto, and Asiacrypt. iacr.org/hybridpropos... I would encourage members to engage in discussion about this on iacr.org/discuss
iacr.org
Concrete Hybrid Journal Proposal
01911
Reposted by Tianxin Tang
Quanta Magazine @quantamagazine.org · 06/07/2026
Researchers have long suspected that for some computational problems, checking a solution is only possible with an exotic mathematical object called a quantum proof — no ordinary written document will do. Now, a team of researchers has finally confirmed it. www.quantamagazine.org/researchers-...
quantamagazine.org
Researchers Reveal the Power of ‘Quantum Proofs’ | Quanta Magazine
When checking that solutions to certain problems are correct, it turns out, you can’t get around the inherent complexity of the quantum world.
0283
Reposted by Tianxin Tang
ePrint Updates @eprint.ing.bot · 30/06/2026
Principles for pRHL Proofs of Cryptographic Protocols: How to Convince EasyCrypt that your Protocol is Secure (Manuel Barbosa, François Dupressoir, Cameron Low, Charlotte Mylog, Sabine Oechsner, Théo Vignon) ia.cr/2026/1334
Abstract. The EasyCrypt proof assistant has been used to successfully formalize security proofs for a wide variety of crypto- graphic primitives. However, attempts at formalizing objects with interactivity, such as protocols, have fared much worse. In this paper, we investigate (some of) the reasons for this difficulty by formalizing a simple interactive key agreement protocol. From a first complete but exploratory proof, to a failed attempt at a structured proof, and to what we believe is an “essential” proof, we identify which proof features contribute most to the complexity of formalization in pRHL. In particular, we argue that difficulties in formalizing the security of interactive protocols in the computational model arise from the fact that such proofs rely on both state and temporal invariants—the former to support cryptographic reasoning, and the latter to support reasoning about the protocol’s structure. We believe that this observation can help build new reasoning tools that can bridge the gap that currently exists between primitive-focused tools and protocol- focused tools.
022
Reposted by Tianxin Tang
Filippo Valsorda @filippo.abyssdomain.expert · 22/06/2026
There we go. US Gov tightens post-quantum cryptography transition deadlines for high-value systems to 2030 for key exchange and 2031 for signatures. Also, speeding up the CMVP (FIPS 140 validation) processes. That’s how you know the rush is real. The quantum computers are (potentially) coming.
whitehouse.gov
Securing the Nation Against Advanced Cryptographic Attacks
By the authority vested in me as President by the Constitution and the laws of the United States of America, it is hereby ordered: Section 1.  Background
411030
Tianxin Tang @koptxin.bsky.social · 17/06/2026
I am looking for a (fully funded) PhD student working with me in Glasgow on provable security! www.iacr.org/jobs/item/4226
iacr.org
PhD Student
087
Tianxin Tang @koptxin.bsky.social · 12/06/2026
Seems like a nice program. See you at Bristol :) uk-crypto-day.github.io/2026/06/17/u...
uk-crypto-day.github.io
UK Crypto Day
Schedule 09:00 - 09:45 Arrival 09:45 - 10:00: Opening remarks 10:00 - 10:45: Sofia Celi: Threshold Post-Quantum Signatures 10:45 - 11:15: Break 11:15 - 12:00: Thalia Laing: Lessons from deploying LMS ...
011
Reposted by Tianxin Tang
Miro Haller @mirohaller.bsky.social · 11/06/2026
The Workshop on Attacks in Cryptography 8 (WAC8) website is finally up, and our call for talks is open. Submit your cool cryptanalysis before July 3! We'll also invite speakers. If you had a favorite cryptographic attack from the last two years that we should invite, please put it in the comments.

call for talks

WAC accepts proposals for contributed talks. Submissions will be evaluated based on their relevance to the following topics:
- Cryptanalysis of deployed cryptography
- Cryptanalysis of recently suggested cryptographic schemes or primitives
- New cryptoanalytic techniques
- Systems attacks breaking cryptography or bypassing underlying assumptions

Please include the following information in your contributed talk submission.
- Title.
- Description of the talk content, including: short abstract (to be published on the website on talk acceptance), and one of the following three: extended abstract describing the talk. [preferred option], a full paper and a short description of which aspects the talk will focus on. slides for a presentation, together with either speaker notes or a short outline of the non-visual content of the talk.
- Speaker information: Name, Affiliation, Short bio (to be published on the website on talk acceptance), A brief description of the relevant experience of the speaker, e.g. links to previous talks.

Submit your proposal by email to the organizers at wac@cryptanalysis.fun by July 3, 2026 AoE.
074
Reposted by Tianxin Tang
Michele Orrù @tumbolia.bsky.social · 11/06/2026
the super secret project i've been working on the past year is out
2255
Reposted by Tianxin Tang
Ei/PSI @ei-psi.bsky.social · 11/06/2026
We've now posted the schedule for the event. Come for a day of insightful and engaging talks. eipsi.win.tue.nl/surveillance...
eipsi.win.tue.nl
Security in Times of Surveillance
022
Reposted by Tianxin Tang
Ei/PSI @ei-psi.bsky.social · 08/06/2026
Security in Times of Surveillance eipsi.win.tue.nl/surveillance... w Marrtin Albrecht @malb.bsky.social Chloé Berthélémy (EDRi), Rikke Bjerg Jensen (RHUL), Thomas Lohninger @socialhack.bsky.social Björn Ruytenberg @0xiphorus.infosec.exchange.ap.brid.gy Carmela Troncoso @carmelatroncoso.bsky.social
143
Reposted by Tianxin Tang
Marcel Keller @mkskeller.bsky.social · 05/06/2026
UNSW Sydney is hiring an associate professor and a lecturer in cryptography, and the description explicitly mentions *secure computation*. Didn't you want to live in the sunniest of the most livable cities in the world?
external-careers.jobs.unsw.edu.au
Associate Professor in Cryptography
Join an organisation that is shaping the future direction of cryptography and secure computation in Australia, in a senior academic role that combines research leadership, strategic contribution, and ...
166
Reposted by Tianxin Tang
Simons Institute for the Theory of Computing @simonsinstitute.bsky.social · 27/05/2026
2/2 "The trick is actually fixing the evaluations. It’s going to be a problem of the way we evaluate language models. We need to reward them for being humble, and saying occasionally, ‘I don’t know,’ or asking a question," said OpenAI's Adam Kalai at the Simons Institute.
011
Tianxin Tang @koptxin.bsky.social · 22/05/2026
For anyone interested in being a tadpole reviewer (interesting concept, suitable for PhD students and early post-docs) for PETS 2027, you can submit an application using the following link: cryptpad.fr/form/#/2/for.... The PC application form can also be found on the website.
111
Reposted by Tianxin Tang
Nalini Joshi @monsoon0.bsky.social · 21/05/2026
You may find the comments by Melanie Matchett Wood on the discovery of a counter example to Erdős’ Unit Distance Conjecture as interesting as I did 👇🏼(see previous post for a link)
A screenshot of p.17 of the paper available at https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf
27818
Tianxin Tang @koptxin.bsky.social · 20/05/2026
Nice show, plenty of information on the latest developments of quantum computers zeroknowledge.fm/podcast/400/
zeroknowledge.fm
Quantum Advances, Hybrid Signatures and SNARKs to the Rescue with Dan Boneh - ZK PODCAST
In this 400th episode, Anna Rose welcomes back Dan Boneh, professor of computer science and electrical engineering at Stanford University, […]
010
Reposted by Tianxin Tang
Mathy Vanhoef @vanhoefm.bsky.social · 19/05/2026
Nominate yourself to help review papers for USENIX Security 2027! sec-rms.com/submit-appli... (or rms.swag.cispa.de/submit-appli... ). Deadline: May 28, 2026. We're looking for both senior and junior people. See Andrei Sabelfeld's LinkedIn post for more info: www.linkedin.com/feed/update/...
sec-rms.com
Signal PC interest - USENIX Security Symposium
025
Reposted by Tianxin Tang
Sofia Celi @claucece.bsky.social · 14/05/2026
Go MAYO!! Moving to the third round of the PQC NIST process!
0115
Reposted by Tianxin Tang
Andrea Basso @andreavbasso.bsky.social · 14/05/2026
Round 3 of the NIST additional signatures process announced! 🎉 And SQIsign is part of it!! ⛷️⛷️
Screenshot of email announcement saying:

Nine Candidates Advance to the Third Round of the Additional Digital Signatures for the PQC Standardization Process

 After 18 months of evaluation, NIST has selected nine candidates for the third round of the Additional Digital Signatures for the Post-Quantum Cryptography (PQC) Standardization Process. The advancing digital signature algorithms are:

FAEST
HAWK
MAYO
MQOM
QR-UOV
SDitH
SNOVA
SQIsign
UOV
02613
Reposted by Tianxin Tang
Hetan Shah @hetanshah.bsky.social · 09/05/2026
This 1952 memo from the Pentagon UFO files is superb There is no point preparing for aliens ‘because no one of consequence is going to take this rubbish seriously unless it happens. At that point, our policy will be determined in the traditional manner of grand panic.’ 🤣 www.war.gov/medialink/uf...
There likely is nothing to be done at the moment to prepare for these possibilities (the only body of writing on the subject available in an emergency is science fiction), because no one of consequence is going to take this rubbish seriously unless it happens. At that point, our policy will be determined in the traditional manner of grand panic.

Maxwell W. Hunter, II
Member, Professional Staff
7054521637
Reposted by Tianxin Tang
Doreen Riepel @doreenriepel.bsky.social · 08/05/2026
Join us tomorrow for ProTeCS, one of Eurocrypt’s affiliated events! We are thankful to have two amazing invited speakers, Bart Mennink and Mike Rosulek! We are also happy to have seven contributed talks from the community. Check out our full program here: protecs-workshop.gitlab.io/program
protecs-workshop.gitlab.io
Program
Workshop on Proofs and Proof Techniques for Cryptographic Security. Affiliated with Eurocrypt 2026.
163
Reposted by Tianxin Tang
ePrint Updates @eprint.ing.bot · 05/05/2026
A Survey on Security Reductions in Post-Quantum Cryptography (Thomas Attema, Ronald Cramer, Serge Fehr, Yu-Hsuan Huang, Bor de Kock, Jana Sotáková) ia.cr/2026/846
Abstract. It is obviously necessary that the security of post-quantum cryptographic schemes is based on computational problems that are hard to solve even with a quantum computer (unlike, e.g., factoring). Examples of such computational problems appear in the theory of lattices or in coding theory. However, this is not sufficient: also the security proof, which comes in the form of an algorithmic reduction that turns any hypothetical attacker into an algorithm that solves the considered hard computational problem, needs to be valid when considering quantum computing as the model of computation.

In this work, we provide an overview of the hurdles one typically encounters when proving the security of post-quantum cryptographic schemes, and we elaborate on some of the mathematical techniques that have been developed in order to overcome these hurdles (to some extent). We also discuss the caveat that even when a security proof can be established (by reducing the security to a quantum-hard computational problem), the reduction often suffers from a larger reduction loss, compared to when proving classical security, which negatively affects the concrete security.

In the second part of this work, we offer a survey of the respective reduction losses in (1) generic transformations that are often used in the design of cryptographic schemes (like the Fiat-Shamir and Fujisaki-Okamoto transformations), and (2) some concrete cryptographic schemes (with a focus on those standardized by NIST), when considering classical and when considering post-quantum security.

Finally, we consider the notion of bit security, the standard measure of the concrete security of a cryptographic scheme (or of the hardness of an underlying computational problem). A natural question is how the bit security is affected by the different reduction losses we encountered. Surprisingly, we observe that a better or worse reduction (in terms of the reduction loss) is not always reflected as such in the bit security. We explain this phenomenon by the fact that the bit security is oblivious to the actual advantage–time function, and instead considers a worst-case behavior of that function. Thus, by exploiting the actual advantage–time function there is potential to get more accurate (i.e., less conservative) estimates for the concrete security.
Image showing part 2 of abstract.Image showing part 3 of abstract.
021
Reposted by Tianxin Tang
Miro Haller @mirohaller.bsky.social · 04/05/2026
The Cryptographic Applications Workshop (CAW) happens this Sunday in Rome! Just a reminder that if you're not coming to Rome you can still attend remotely. Just register here: forms.gle/2JZ7hLs8diQM... before May 8. See caw.cryptanalysis.fun for more infos and our program.
Program of CAW, also on our website: https://caw.cryptanalysis.fun/
086
Tianxin Tang @koptxin.bsky.social · 03/05/2026
Collected all badges!
010
Reposted by Tianxin Tang
Fredrik Dahlgren @fegge.bsky.social · 17/04/2026
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...
A table listing total operations, number of qubits, and Toffoli-gate count for Google's low-gate and low-qubit implementations, and Trail of Bits' implementation. The Trail of Bits implementation beats Google's on every metric.
18230
Reposted by Tianxin Tang
Sabine Oechsner @proofnerd.bsky.social · 17/04/2026
I'm looking for a PhD student to work with me on formal verification for cryptographic protocols. This is a 4-year position at VU Amsterdam, co-supervised with Kristina Sojakova. Send me an email if you want to know more!
11013
Reposted by Tianxin Tang
ePrint Updates @eprint.ing.bot · 08/04/2026
Open Problems in List Decoding and Correlated Agreement (Gal Arnon, Dan Boneh, Giacomo Fenzi) ia.cr/2026/680
Abstract. The Ethereum Foundation recently announced the Proximity Prize which aims to resolve some open problems that play an important role in the design of succinct proof systems. This paper reviews the open problems relevant to the Proximity Prize. We focus on some grand challenges relating to list decoding bounds, proximity gaps, correlated agreement, and mutual correlated agreement,as they relate to proof systems and Reed–Solomon codes. Along the way we survey the known results on these topics.
095
Reposted by Tianxin Tang
Abdullah Talayhan @talayhan.bsky.social · 27/03/2026
The Signal protocol is well documented but hard to grasp the first time. Especially what's happening under the hood while using a messaging app. I built an educational tool that lets you chat on a simulated phone and see protocol details in real time, completely offline. Enjoy!
3379
Reposted by Tianxin Tang
Nadim Kobeissi @nadim.computer · 23/03/2026
Major announcement: My highly successful Applied Cryptography course taught last year at the American University of Beirut is returning as an online course, available for FREE for any qualifying student from any Lebanese university! Read more + apply today — and please spread the word!
symbolic.software
Applied Cryptography: Free Online Course for 50 Lebanese University Students This Summer
We're opening 50 spots for students at Lebanese universities to take the Applied Cryptography course online, completely free of charge, starting June 2026. Applications are open now.
1133
Reposted by Tianxin Tang
Stefano Tessaro @stefanotessaro.bsky.social · 18/03/2026
Huge congrats to Bennett and Brassard for the well-deserved award, but the highlighted sentence from the ACM announcement (www.acm.org/media-center...) is a rather odd take on PQC ...
"Quantum cryptography, alongside emerging, hopefully quantum-resistant classical approaches for which no proofs of security are known, represents one pathway toward securing digital communications in the decades ahead."
072
Reposted by Tianxin Tang
Real World Crypto Symposium @rwc.iacr.org · 08/03/2026
Watching remotely? You can follow Real World Crypto 2026 on YouTube livestreams (also available via the website): Day 1 (Mar 9): youtube.com/live/QQhyxFj... Day 2 (Mar 10): youtube.com/live/00zvMSW... Day 3 (Mar 11): youtube.com/live/v_AFtbW...
0128
Reposted by Tianxin Tang
Colin Gorrie @colingorrie.bsky.social · 18/02/2026
If you liked this experiment, I published a full piece today in the same vein: a text that gets 100 years older with every section, from a modern blog post to a medieval chronicle. It's a single story spanning 1000 years of English. See how far you get. www.deadlanguagesociety.com/p/how-far-ba...
deadlanguagesociety.com
How far back in time can you understand English?
An experiment in language change
19936571333
Tianxin Tang @koptxin.bsky.social · 13/02/2026
monosketch.io (pretty nice tool!)
monosketch.io
MonoSketch - Unleash your ideas with ASCII
MonoSketch is a powerful ASCII sketching and diagramming app that lets you effortlessly transform your ideas into visually stunning designs.
000
Reposted by Tianxin Tang
mccurley.bsky.social @mccurley.bsky.social · 03/02/2026
The IACR board sent a survey to members last year, and it took us a while to analyze the results and publish findings. You can see them at iacr.org/surveyresults/
iacr.org
International Association for Cryptologic Research
289
Reposted by Tianxin Tang
Pavel @spavel.bsky.social · 01/02/2026
Person: say, i am alive.

Computer: I am alive.

Person: oh my god.
82231975062
Tianxin Tang @koptxin.bsky.social · 06/01/2026
blog.computationalcomplexity.org/2026/01/ai-a...
blog.computationalcomplexity.org
AI and Research Papers
2026 will be a year of AI disruption across all of academia. Let's start by talking about AI is changing how we write research papers. Not t...
100
Reposted by Tianxin Tang
maia arson crimew 🏴 @crimew.gay · 27/12/2025
gpg.fail
724861
Reposted by Tianxin Tang
Filippo Valsorda @filippo.abyssdomain.expert · 27/12/2025
At the gpg.fail talk and omg #39c3 You can just put a \0 in the Hash: header and then newlines and inject text in a cleartext message. Won’t even blame PGP here. C is unsafe at any speed. gpg has not fixed it yet.
4431108
Reposted by Tianxin Tang
Real World Crypto Symposium @rwc.iacr.org · 19/12/2025
The accepted talks for Real World Crypto 2026 are now online: rwc.iacr.org/2026/accepte... Thanks to everyone who submitted, and we look forward to the discussions at the symposium.
rwc.iacr.org
RWC 2026 accepted papers
Real World Crypto Symposium
0239