Home Research Talks CV Contact
Selected Talks
- On the Power of Choice for k-colorability of Random Graphs at International Conference on Randomization and Computation 2021, Zoom (August 2021)
- Bankrupting Sybil Despite Churn at 41st IEEE International Conference on Distributed Computing Systems, Zoom (July 2021)
- Resource Burning based Sybil Defense given at NUS CS Seminar, National University of Singapore, Singapore (February 2021); Cryptography, Cybersecurity and Distributed trust (CCD) group at IIT Madras, Zoom (August 2021)
- Beating Sybil with Resource Burning given at CS Colloquium, University of New Mexico, USA (September 2020)
- Sybil Defense via Resource Burning given at Aalto CS Theory Seminar, Aalto University, Finland (July 2020)
- Towards a Lazy yet Efficient Dynamic DHT given at STEM Symposium, University of New Mexico, USA (February 2020)
- A Scalable Algorithm for Multiparty Interactive Communication with Private Channels, given at International Conference on Distributed Computing and Networking (ICDCN), Jadavpur University-Kolkata, India (January 2020)
- On Computationally-Efficient Sybil Defense, given at Workshop on Security of Permissionless Systems (Co-located with PODC’19), Toronto, Canada (August 2019)
- Peace through Superior Puzzling: An asymmetric Sybil Defense, given at IPDPS’19, Brazil (May 2019)
- Proof-of-Work Without all the Work: Computationally Efficient Sybil Defense Techniques, given at IIT Delhi, India (January 2019)
- Puzzling Sybil into Bankruptcy, given at the 3rd Winter School on Blockchains, IIAS, Hebrew University, Israel (December 2018)
- Proof-Of-Work Based Sybil Defense, given at Workshop on Competitive Economics of Cybersecurity, Sandia National Labs, USA (November 2018)
- Proof-of-Work Without all the Work, given at International Conference on Distributed Computing and Networking (ICDCN), IIT BHU, India (January 2018)
- Stumping Sybil with Computational Puzzles, given at Mid-South Theory Day, Louisiana State University, USA (December 2016)