American cryptographer (born 1974)
Amit Sahai (born 1974) is an Indian-American computer scientist. He is a professor of computer science at UCLA and the director of the Center for Encrypted Functionalities.
Biography.
Amit Sahai was born in 1974 in Thousand Oaks, California, to parents who had
immigrated from India. He received a B.A. in mathematics with a computer
science minor from the University of California, Berkeley, summa cum laude, in
1996.
At Berkeley, Sahai was named Computing Research Association Outstanding
Undergraduate of the Year, North America, and was a member of the three-person
team that won first place in the 1996 ACM International Collegiate Programming Contest.
Sahai received his Ph.D. in computer science from MIT in 2000, and joined the
computer science faculty at Princeton University. In
2004 he moved to UCLA, where he currently holds the position of professor of
computer science.
Research and recognition.
Amit Sahai's research interests are in security and cryptography, and theoretical
computer science more broadly. He has published more than 100 original
technical research papers.
Notable contributions by Sahai include:
Sahai has given a number of invited talks including the 2004 Distinguished Cryptographer Lecture
Series at NTT Labs, Japan. He was named an Alfred P. Sloan Foundation Research
Fellow in 2002, received an Okawa Research Grant Award in 2007, a Xerox
Foundation Faculty Award in 2010, and a Google Faculty Research Award in 2010.
His research has been covered by several news agencies including the BBC World
Service.
Sahai was elected as an ACM Fellow in 2018 for "contributions to cryptography and to the development of indistinguishability obfuscation".
In 2019, he was named a Fellow of the International Association for Cryptologic Research for "fundamental contributions, including to secure computation, zero knowledge, and functional encryption, and for service to the IACR."
Sahai was named a Simons Investigator by the Simons Foundation in 2021. He was also named a Fellow of the Royal Society of Arts.
In 2022, he received the Michael and Shelia Held Prize from the National Academy of Sciences for “outstanding, innovative, creative, and influential research in the areas of combinatorial and discrete optimization, or related parts of computer science, such as the design and analysis of algorithms and complexity theory.”
In 2023, he received the Test of Time Award from the International Association for Cryptologic Research for his 2008 paper "Efficient Non-interactive Proof Systems for Bilinear Groups".
He was elected as a Fellow of the American Mathematical Society in the 2024 class of fellows.
References.
 ;templatestyles src="Reflist/styles.css" / ;