Dan Boneh to Receive 2014 ACM-Infosys Foundation Award
March 31, 2015
ACM has named Dan Boneh the recipient of the 2014 ACM-Infosys Foundation Award in the Computing Sciences for ground-breaking contributions to the development of pairing-based cryptography and its application in identity-based encryption. His work helped establish the field of pairing-based cryptography, a dominant area in cryptography for the last decade, by demonstrating the use of pairing functions to solve a wide variety of problems in cryptography. Boneh, with Matt Franklin, showed how pairings could be used to develop a fully functional identity-based encryption scheme (IBE). This ushered in a new area of cryptography research to which Boneh's contributions have been central. Pairing-based cryptography makes security mechanisms easier to use and deploy, and improves computer security to keep data, devices and critical systems safe, private and accessible.
Dan Boneh is professor of Computer Science and Electrical Engineering at Stanford University, and leads the applied cryptography group there. He has written extensively on cryptography and computer security, publishing more than 150 refereed conference and peer-reviewed journal papers. Boneh served as an editor of ACM Transactions on Internet Technology (TOIT), Journal of the ACM (JACM), and Journal of Cryptology. He has served as program chair or general chair for several academic conferences and as member of more than 30 conference program committees.
The ACM-Infosys Foundation Award recognizes the finest recent innovations by young scientists and system developers in the computing field. An endowment from the Infosys Foundation provides financial support for the $175,000 annual award.
ACM will present the award at its annual Awards Banquet on June 20 in San Francisco, California.
