Aditya Hegde
I’m a PhD student in the ARC group at Johns Hopkins University where I’m advised by Abhishek Jain and Matthew Green. My research interests are in cryptography and more broadly, in theoretical computer science.
From June to July 2024, I visited Geoffroy Couteau. In 2021, I completed an Integrated Masters (B.Tech + M.Tech) in Computer Science and Engineering at IIIT Bangalore, where I was advised by Ashish Choudhury. During Spring 2021, I worked with members of the CrIS Lab under the supervision of Arpita Patra.
Papers
In cryptography, authors are generally listed in alphabetical order. An asterisk (*) is used in case of exceptions to indicate equal contribution and lead authorship.
Unpublished Mansucripts
- How to Trace Viral Content in End-to-End Encrypted Messaging
Pedro Branco, Matthew Green, Aditya Hegde, Abhishek Jain, Gabriel Kaptchuk
2026
- Client-Server Homomorphic Secret Sharing in the CRS Model
Damiano Abram, Geoffroy Couteau, Lalita Devadas, Aditya Hegde, Abhishek Jain, Lawrence Roy, Sacha Servan-SchreiberEUROCRYPT
2025
- 𝜔(1/𝜆)-Rate Boolean Garbling Scheme from Generic Groups
Geoffroy Couteau, Carmit Hazay, Aditya Hegde, Naman KumarCRYPTOEprint - Enhanced Trapdoor Hashing from DDH and DCR
Geoffroy Couteau, Aditya Hegde, Sihang PuEUROCRYPT - Breaking the 1/λ-Rate Barrier for Arithmetic Garbling
Geoffroy Couteau, Carmit Hazay, Aditya Hegde, Naman KumarEUROCRYPTEprint - Multi-Key Homomorphic Secret Sharing
Geoffroy Couteau, Lalita Devadas, Aditya Hegde, Abhishek Jain, Sacha Servan-SchreiberEUROCRYPTEprint
2024
- Homomorphic Secret Sharing with Verifiable Evaluation
Arka Rai Choudhuri, Aarushi Goel, Aditya Hegde, Abhishek JainTCCEprint
2023
- Scalable Multiparty Garbling
Gabrielle Beck, Aarushi Goel, Aditya Hegde, Abhishek Jain, Zhengzhong Jin, Gabriel Kaptchuk
2022
- Attaining GOD Beyond Honest Majority with Friends and Foes
Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul - Secure Multiparty Computation with Free Branching
Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain
2021
- SoK: Efficient Privacy-preserving Clustering
Aditya Hegde, Helen Möllering, Thomas Schneider, Hossein Yalame
2020
Talks
- Client-Server Homomorphic Secret Sharing in the CRS Model
- NTT CIS SeminarSlides
- 𝜔(1/𝜆)-Rate Boolean Garbling Scheme from Generic Groups
- CRYPTO 2025Slides
- Breaking the 1/λ-Rate Barrier for Arithmetic Garbling
- Enhanced Trapdoor Hashing from DDH and DCR
- Multi-key Homomorphic Secret Sharing
- Homomorphic Secret Sharing with Verifiable Evaluation
- TCC 2024Slides
- How to Trace Viral Content in End-to-End Encrypted Messaging
- UMD College Park
- Scalable Multiparty Garbling
- SoK: Efficient Privacy-preserving Clustering
- High Throughput Secure MPC Over Small Population in Hybrid Networks
- Ethics, Prosperity, and Society: Moral Evaluation Using Virtue Ethics and Utilitarianism
- IJCAI 2020Slides
Service
External Reviewer: ACM TOPS 2022, ACNS 2025, ASIACRYPT (2024, 2025), CCS (2021, 2023), CRYPTO (2023, 2025), EUROCRYPT (2025, 2026), INDOCRYPT 2023, ITC 2021, PODC 2021, S&P (2023, 2024), TCC (2023, 2024, 2025), USENIX (2024, 2025)
Reviewer: Design, Codes and Cryptography 2024
Teaching
I am co-teaching Modern Cryptography at JHU with Harry Eldridge this semester (Spring 2026).
I have also served as a teaching assistant for the following courses.
- Practical Cryptography (JHU): 2025
- Foundations of Cryptography (IIIT Bangalore): 2020, 2021
- Discrete Mathematics (NPTEL): 2021
- Discrete Mathematics (IIIT Bangalore): 2020