Hemanta K. Maji
Computer Science · Purdue University West Lafayette
Publications
95
Citations
1,625
Est. group size
~4
Recurring co-author estimate
Active years
23
Publishing since 2003
Hemanta K. Maji works in cryptography, focusing on how information can be securely split, shared, or computed on without being fully exposed. Much of his recent work examines 'secret sharing' schemes (methods for dividing a secret among multiple parties so that no small subset can reconstruct it) and how these schemes hold up against partial data leaks or physical side-channel attacks. He also studies theoretical limits of fair multi-party computation, such as coin-tossing protocols where no participant should be able to bias the outcome.
Publication output rose to a peak around 2020-2021 and has since settled into a steadier, lower pace of about 3 papers per year in recent years.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Leakage-Resilience of Shamir's Secret Sharing: Identifying Secure Evaluation Places
Repository for Publications and Research Data (ETH Zurich) · 2025
- Constructing Leakage-Resilient Shamir’s Secret Sharing: Over Composite Order Fields
Lecture notes in computer science · 2024
- Improved Bound on the Local Leakage-resilience of Shamir’s Secret Sharing
2022 IEEE International Symposium on Information Theory (ISIT) · 2022
- Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family
Lecture notes in computer science · 2022
- P 4 -free Partition and Cover Numbers & Applications.
International Test Conference · 2021
- Computational Hardness of Optimal FairComputation: Beyond Minicrypt.
IACR Cryptology ePrint Archive · 2021
- Leakage-resilience of the Shamir Secret-sharing Scheme against Physical-bit Leakages.
IACR Cryptology ePrint Archive · 2021
- Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
Lecture notes in computer science · 2021
- Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages
Lecture notes in computer science · 2021
- Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes
Lecture notes in computer science · 2021
- Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks
2021
- Constructing Locally Leakage-resilient Linear Secret-sharing Schemes
IACR Cryptology ePrint Archive · 2020
- P 4 -free Partition and Cover Numbers.
IACR Cryptology ePrint Archive · 2020
- Computational Hardness of Collective Coin-Tossing Protocols
Entropy · 2020
- Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing.
IACR Cryptology ePrint Archive · 2020
- Lecture notes in computer science×18
- IACR Cryptology ePrint Archive×13
- arXiv (Cornell University)×2
- DOAJ (DOAJ: Directory of Open Access Journals)×1
- Proceedings on Privacy Enhancing Technologies×1
- Yan Huang
Computer Science · Indiana University
- Hamidreza Amini Khorasgani
Computer Science · Purdue University West Lafayette
- Aarushi Goel
Computer Science · Purdue University West Lafayette
- Zhenhua Chen
Computer Science · The Ohio State University
- Seunghoon Lee
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