Hamidreza Amini Khorasgani
Computer Science · Purdue University West Lafayette
Publications
17
Citations
45
Est. group size
~2
Recurring co-author estimate
Active years
13
Publishing since 2014
Hamidreza Amini Khorasgani works on theoretical cryptography, focusing on secure multi-party computation (methods that let multiple parties jointly compute something without revealing their private inputs to each other), coin-tossing protocols, and mathematical frameworks for understanding when and how efficiently such secure computations can be done. Much of the work uses geometric and information-theoretic tools to analyze the feasibility and communication cost of these cryptographic tasks. This research is largely theoretical, aimed at establishing foundational limits and constructions rather than building deployable systems.
Publication output has been modest and fairly steady over the past decade, with a small cluster of papers per year (roughly 1-3) rather than a clear growth or decline trend.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- <b>A GEOMETRIC FRAMEWORK FOR DECIDING THE FEASIBILITY AND COMMUNICATION COMPLEXITY OF SECURE TWO-PARTY COMPUTATION</b>
Open MIND · 2026
- <b>A GEOMETRIC FRAMEWORK FOR DECIDING THE FEASIBILITY AND COMMUNICATION COMPLEXITY OF SECURE TWO-PARTY COMPUTATION</b>
Purdue · 2026
- Solving Linear Inequalities over the Space of Convex Sets & its Applications to Cryptography and Hydrodynamics
2025
- Randomized Functions with High Round Complexity
Lecture notes in computer science · 2023
- Secure Non-interactive Simulation: Feasibility and Rate
Lecture notes in computer science · 2022
- Secure Non-interactive Simulation from Arbitrary Joint Distributions
Lecture notes in computer science · 2022
- Geometry of Secure Two-party Computation
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) · 2022
- Optimally-secure Coin-tossing against a Byzantine Adversary
2021
- Efficient Distributed Coin-tossing Protocols
2021
- Decidability of Secure Non-interactive Simulation of Doubly Symmetric Binary Source.
IACR Cryptology ePrint Archive · 2021
- Design & Analysis of Optimal Coin-tossing: New Techniques.
IACR Cryptology ePrint Archive · 2020
- Secure Non-interactive Simulation: Feasibility & Rate
IACR Cryptology ePrint Archive · 2020
- Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness
Lecture notes in computer science · 2019
- Estimating Gaps in Martingales and Applications to Coin-Tossing:\n Constructions and Hardness
arXiv (Cornell University) · 2019
- Lecture notes in computer science×4
- IACR Cryptology ePrint Archive×3
- 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)×1
- arXiv (Cornell University)×1
- Open MIND×1
- Hemanta K. Maji
Computer Science · Purdue University West Lafayette
- Yan Huang
Computer Science · Indiana University
- Zhenhua Chen
Computer Science · The Ohio State University
- Aarushi Goel
Computer Science · Purdue University West Lafayette
- Vassilis Zikas
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