Jianting Zhang retweeted
Less than a week left to submit your work to the MCP workshop @IFCA_Conference! We welcome talk and paper submissions. Talks are non-archival, so work published elsewhere is welcome.
More information: fc27.ifca.ai/mcp/
Jianting Zhang retweeted
After 29 years, ACM CCS will be back to Singapore. See you in Singapore in 2028!
#cybersecurity, #conference, #acm, #ccs, #Singapore
I'll be at ACM CCS @acm_ccs this week, presenting our paper on the afternoon of Nov 18!
arxiv.org/abs/2504.13398
If you're around, feel free to reach out — would love to chat!
Jianting Zhang retweeted
[Revised] Pufferfish: DAG-Guided Speculative Execution for Low-Latency BFT SMR (Jianting Zhang and Alberto Sonnino and Lefteris Kokoris-Kogias and Aniket Kate) ia.cr/2026/796
While x402 and ERC-8004 are accelerating the permissionless AI market, how can we resist the reputation manipulation?
Check out our latest work to learn more details👇
The reputation system for AI agents is a challenging problem!
We take some concrete steps to mitigate the Sybil AI agent challenge in this space: arxiv.org/pdf/2610.12948
Led by @EtherCS
Jianting Zhang retweeted
Attention arXiv authors. Because of the exponential increase in submissions, arXiv is limiting the number of papers that a person can submit each month to two. 1/
arXiv has updated our policy on rate limiting for all submitters.
This update was made to fairly distribute moderator time & support the arXiv community of staff, volunteers, readers & authors.
Please read our announcement to learn more: blog.arxiv.org/2026/10/01/up…
Congrats! It has been a great pleasure working with you and sharing ao many great memories together. Wishing you all the best in your next chapter.
Replying to @zhtluo
Huge thanks to my committee, @aniketpkate, @ninghui_li, @CryptoGPS, and Prof. Yongle Zhang.
Also thanks to @EtherCS and @Yanxue19 for all the projects we have worked on.
Here's to the future ahead.
3
203
Excited to attend my first EuroSys’26 next week (April 27-30)! If you’re around, let’s connect!
#EuroSys26
📍 Tuesday, April 28, 15:45–17:30 (Track B)
I’ll present “Towards Improving Throughput and Scalability of DAG-based BFT SMR” on behalf of @nibeshrestha2 and @aniketpkate. Paper link: eprint.iacr.org/2025/877.pdf
📍 Wednesday, April 29, 10:15–10:45
I’ll also present “Five Minutes of DDoS Brings down Tor: DDoS Attacks on the Tor Directory Protocol and Mitigations”, joint work with @zhtluo Akshat Neerati, and @aniketpkate. Paper link: arxiv.org/pdf/2509.10755
Jianting Zhang retweeted
Exciting news! I have joined the world-leading team at @Mysten_Labs.
I am working on distributed systems & crypto projects led by @GDanezis, @kostascrypto, n @0x4252. It is great to be part of this highly-productive team with academic thinking & startup-level execution speed...
Jianting Zhang retweeted
Introducing Project Glasswing: an urgent initiative to help secure the world’s most critical software.
It’s powered by our newest frontier model, Claude Mythos Preview, which can find software vulnerabilities better than all but the most skilled humans.
anthropic.com/glasswing
Introducing EVMbench—a new benchmark that measures how well AI agents can detect, exploit, and patch high-severity smart contract vulnerabilities. openai.com/index/introducing…
Jianting Zhang retweeted
KZG polynomial commitment paper has received the 2025 IACR Test-of-Time award for Asiacrypt 2010!🎉
Greg, Ian, and I are honored and grateful to receive the award. Thanks to @IACR_News for the selection.
This award was only possible because of the efforts and interest from many researchers and developers in the blockchain and (zk)snarks space in the last ten years. So, thanks to all who have built their solutions on polynomial commitments.
Let's keep making verification succinct!
Jianting Zhang retweeted
Happy to share that our work on Hydrangea, a new consensus protocol from @SUPRA_Labs , has been accepted at USENIX Security' 26.
Hydrangea achieves optimistic two-round commit with stronger fault resilience than prior work. For a system with n=3f+2c+k+1, it commits in two rounds with up to p~=(c+k)/2 faults, and in three rounds with up to f Byzantine and c crash faults.
We also show this resilience is (nearly) optimal for optimistic two-round commit.
Paper Link: eprint.iacr.org/2025/1112
Jianting Zhang retweeted
It does feel uniquely research-y to write a paper to settle a Stack Overflow question probably nobody actually cared about...
All Our TeX Source Are Not Belong to You: PDF Obfuscation against arXiv's TeX Source Policies
zhtluo.com/paper/All_Our_TeX…
Jianting Zhang retweeted
Decentralization underpins permissionless blockchains, but what about geography? 🌍 Our new study explores this often-overlooked dimension of crypto. (1/n)
Jianting Zhang retweeted
MPC can be ready for your confidentiality apps now!
Secure Multi-Party computation (MPC) protocols are crucial tools in security-critical distributed systems, including blockchains. They represent a strict generalization of FHE, and are now ripe to be integrated into the blockchain space.
Crypto literature employed Information-Theoretic cryptography to design protocols, which incurs a high communication cost. Subsequent literature improved communication costs using public-key cryptography; however, these protocols incur a large computational cost from expensive public-key operations, which inhibits scalability.
We address this bottleneck by designing protocols using lightweight cryptography - cryptographic Hash functions and Symmetric Key Encryption. These primitives are 1000x faster than public-key-based primitives, and they are also friendly to the Post-Quantum world. However, as these tools lack the transcript homomorphism offered by public-key-based tools, we employ novel distributed computing techniques to limit the increase in communication compared to public-key-based protocols.
The project is led by @akhilsai2712. Joint work w/@bagchi_saurabh, @_hermitsage_, Xiaoyu Ji, Soham Jog, @chendaLiu, Daniel Pöllmann, @mk_reiter, Yifan Song
Jianting Zhang retweeted
Replying to @esnie17
@esnie17 is presenting Recovering from Excessive Faults for blockchains this week
at Usenix Security 2026.
w/ @kartik1507 and @AndrewLewisPye
(Url: eprint.iacr.org/2025/083)
--------------------
Blockchains rely on consensus/SMR/Atomic broadcast protocols to make sure all the nodes in the network agree on the transaction ordering.
What’s the Problem?
These protocols can only handle a certain number of bad or faulty nodes (called Byzantine faults). But what happens if more nodes than expected go bad — more than the system was designed to handle?
Until now, most blockchains would just fail or get stuck. That's a big problem.
What does this work achieve?
We created an extensive fix for this problem — a repair method that helps blockchains recover from too many bad nodes after the fact.
Here’s how it works:
Using signature-based trails, we can detect which nodes are acting badly, without blaming the good ones.
This helps the blockchain "heal" itself and return to normal operation. It may not work as smoothly as if everything were perfect, but it’s still way better than failing completely.
Real-World Test
We built this system into the HotStuff consensus protocol and demonstrated that system performance went back to normal after recovery.
With 30 nodes, there was only a small slowdown (4.3%).
On average, transactions took a bit longer to process (about 12.87% more delay), but the system stayed alive and functional.
We also made versions tailored to specific protocols like Tendermint and HotStuff, making them faster and more efficient.
Better Fault Detection
We also worked on better ways to detect up to n-2 bad nodes in any blockchain that uses BFT. We created a new detection method that works without needing extra messages between nodes
Why This Matters
Now, our blockchain networks could survive and recover even when more nodes go rogue than expected. You get better tools to detect and isolate bad actors. This adds a layer of resilience and reliability to blockchain systems, helping prevent costly downtimes or attacks.
--------------------
Jianting Zhang retweeted
Looking forward to attending SBC in Berkeley next week.
I will be speaking about Threshold AI Oracles at the Summit on Decentralization and AI (rdi.berkeley.edu/events/dece…) on Sunday.
@EtherCS will present Frontrunning on DAG-based Blockchains at SBC on Tuesday.

























