Aniket Kate
Computer Science · Purdue University West Lafayette
Publications
194
Citations
4,611
Est. group size
~7
Recurring co-author estimate
Active years
20
Publishing since 2007
Aniket Kate works on cryptography and secure distributed systems, with a focus on blockchain technologies such as consensus protocols, secret sharing, threshold cryptography, and privacy-preserving communication tools like anonymous networks and secure multiparty computation. Much of the recent work addresses making blockchain systems faster and more scalable (e.g., sharding, DAG-based consensus, verifiable randomness) while also studying and defending against attacks like frontrunning and deanonymization. This research is aimed at building more secure, private, and efficient decentralized systems.
Publication output has remained fairly steady over the last decade, fluctuating between roughly 9 and 18 papers per year without a clear long-term upward or downward trend.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Five Minutes of DDoS Brings down Tor: DDoS Attacks on the Tor Directory Protocol and Mitigations
2026
- The Case of FBA as a DEX Processing Model
Lecture notes in computer science · 2026
- Towards Improving Throughput and Scalability of DAG-based BFT SMR
2026
- Optimal Sharding for Scalable Blockchains with Deconstructed SMR
Proceedings of the VLDB Endowment · 2025
- Sailfish: Towards Improving the Latency of DAG-Based BFT
2025
- Disincentivize Collusion in Verifiable Secret Sharing
Lecture notes in computer science · 2025
- VRaaS: Verifiable Randomness as a Service on Blockchains
2025
- Velox: Scalable Fair Asynchronous MPC from Lightweight Cryptography
2025
- Cauchyproofs: Batch-Updatable Vector Commitment with Easy Aggregation and Application to Stateless Blockchains
2025
- Dyna-hinTS: Silent Threshold Signatures for Dynamic Committees
2025
- No Fish Is Too Big for Flash Boys! Frontrunning on DAG-Based Blockchains
2025
- Vitārit: Paying for Threshold Services on Bitcoin and Friends
2025
- Mixnets on a Tightrope: Quantifying the Leakage of Mix Networks Using a Provably Optimal Heuristic Adversary
2025
- Optimistic, Signature-Free Reliable Broadcast and Its Applications
arXiv (Cornell University) · 2025
- Optimistic, Signature-Free Reliable Broadcast and Its Applications
2025
- arXiv (Cornell University)×27
- IACR Cryptology ePrint Archive×13
- Lecture notes in computer science×11
- Proceedings on Privacy Enhancing Technologies×9
- IEEE Internet Computing×2
- Syed Mahbub Hafiz
Computer Science · Indiana University
- Wenhai Sun
Computer Science · Purdue University West Lafayette
- Vassilis Zikas
Computer Science · Purdue University West Lafayette
- Christina Garman
Computer Science · Purdue University West Lafayette
- Jian Jin
Computer Science · Purdue University West Lafayette
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 20, 2026.
Claim or correct this profile