Aditya Hegde
I鈥檓 currently a PhD student at Johns Hopkins University, advised by Abhishek Jain and Matthew Green.
I’m interested in both theoretical and practical aspects of cryptography. Much of my work focuses on secure computation, and more recently, I’ve been working on cryptographic protocols with low communication and minimal interaction. On the application side, I’m interested in designing systems that balance privacy and accountability.
In summer 2026, I interned at NTT Research with Elette Boyle. Previously, I visited the Simons Institute in summer 2025 and interned at IRIF with Geoffroy Couteau in summer 2024. I graduated from IIIT Bangalore in 2021, where I was advised by Ashish Choudhury.

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.
2026
- How to Trace Viral Content in End-to-End Encrypted MessagingASIACRYPT 2026
- HoneyCodes: Auditable Short-Code Authentication After Verifier CompromiseCCS 2026
- Multiparty Computation with Minimal Overhead without Circuit TransformationCRYPTO 2026 TPMPC 2026
- Client-Server Homomorphic Secret Sharing in the CRS ModelEUROCRYPT 2026
2025
- 饾湐(1/饾渾)-Rate Boolean Garbling Scheme from Generic GroupsCRYPTO 2025
- Enhanced Trapdoor Hashing from DDH and DCREUROCRYPT 2025
- Breaking the 1/位-Rate Barrier for Arithmetic GarblingEUROCRYPT 2025 TPMPC 2025
- Multi-Key Homomorphic Secret SharingEUROCRYPT 2025 TPMPC 2025
2024
- Homomorphic Secret Sharing with Verifiable EvaluationTCC 2024
2023
- Scalable Multiparty Garbling
2022
- Attaining GOD Beyond Honest Majority with Friends and FoesASIACRYPT 2022
- Secure Multiparty Computation with Free BranchingEUROCRYPT 2022
2021
- SoK: Efficient Privacy-preserving ClusteringPETS 2021
2020
- High Throughput Secure MPC Over Small Population in Hybrid NetworksINDOCRYPT 2020
- Ethics, Prosperity, and Society: Moral Evaluation Using Virtue Ethics and UtilitarianismIJCAI 2020
Talks
- Multiparty Computation with Minimal Overhead without Circuit Transformation
- CRYPTO 2026
- Client-Server Homomorphic Secret Sharing in the CRS Model
- NTT CIS Seminar
- DC Area Crypto Day
- EUROCRYPT 2026[recording]
- 饾湐(1/饾渾)-Rate Boolean Garbling Scheme from Generic Groups
- CRYPTO 2025[recording]
- Breaking the 1/位-Rate Barrier for Arithmetic Garbling
- EUROCRYPT 2025[recording]
- Enhanced Trapdoor Hashing from DDH and DCR
- EUROCRYPT 2025[recording]
- Multi-key Homomorphic Secret Sharing
- EUROCRYPT 2025[recording]
- TPMPC 2025[recording]
- Homomorphic Secret Sharing with Verifiable Evaluation
- TCC 2024[recording]
- How to Trace Viral Content in End-to-End Encrypted Messaging
- UMD College Park
- Scalable Multiparty Garbling
- Galois[recording]
- CCS 2023
- SoK: Efficient Privacy-preserving Clustering
- PETS 2021[recording]
- High Throughput Secure MPC Over Small Population in Hybrid Networks
- Indocrypt 2020[recording]
- Ethics, Prosperity, and Society: Moral Evaluation Using Virtue Ethics and Utilitarianism
- IJCAI 2020[recording]
Service
External Reviewer
- ACM TOPS (2022)
- ACNS (2025)
- ASIACRYPT (2024, 2025, 2026)
- CCS (2021, 2023)
- CRYPTO (2023, 2025, 2026)
- EUROCRYPT (2025, 2026)
- ICALP (2026)
- INDOCRYPT (2023)
- ITC (2021)
- PODC (2021)
- S&P (2023, 2024)
- SCN (2026)
- TCC (2023, 2024, 2025, 2026)
- USENIX (2024, 2025)
Reviewer
- Design, Codes and Cryptography (2024)
Teaching
Instructor
- Modern CryptographyJHUSpring 2026co-taught with Harry Eldridge
Teaching Assistant
- Practical CryptographyJHU2025
- Foundations of CryptographyIIIT Bangalore2020IIIT Bangalore2021
- Discrete MathematicsNPTEL2021
- Discrete MathematicsIIIT Bangalore2020