Trustworthy Computing Platforms and Devices
Manuel Blum, the Bruce Nelson University Professor of Computer Science at Carnegie Mellon University, is a pioneer in the field of theoretical computer science and the winner of the 1995 Turing Award in recognition of his contributions to the foundations of computational complexity theory and its applications to cryptography and program checking, a mathematical approach to writing programs that check their work.
He was named Arthur J. Chick Professor of Computer Science in 1995. Blum accepted his present position at Carnegie Mellon in 2001.
The problems he has tackled in his long career include, among others, methods for measuring the intrinsic complexity of problems. Blum’s Speedup theorem is an important proposition about the complexity of computable functions. The Blum axioms give a machine-independent way to understand the complexity of computation, whether that computation is done by human or by computer. Since his early work on the intrinsic limitations of computing devices, Blum’s research has focused on the single unifying theme of finding positive, practical consequences of living in a world where computational resources are bounded. In his work, Blum has shown that secure business transactions, pseudo-random number generation, program checking, and more recently, CAPTCHAs for detecting bot intruders, are possible in part because all computational devices are resource bounded. Blum’s current research includes the HumanOID (Human Oriented ID) project, a cryptographic project designed to develop a challenge-response authentication protocol that humans can perform entirely in
their heads. For this, people must be able to authenticate themselves to a system while a powerful machine-based adversary that knows the protocol listens on the line and records every challenge and response. The system would have to be incapable of learning to impersonate that human. A member of the National Academy of Sciences and the National Academy of Engineering, he is a fellow of the American Academy of Arts and Sciences, the American Association for the Advancement of Science, and the Institute of Electrical and Electronics Engineers. Dr. Blum has held a Sloan Foundation Fellowship and received a University of California at Berkeley Distinguished Teaching
Award, their Faculty Research Award, the Sigma Xi’s Monie A. Ferst Award, the Carnegie Mellon Herbert A, Simons Teaching Award, among other honors. He is the author of more than 50 papers published in leading scientific journals and has supervised the theses of 35 doctoral students who now pepper almost every major computer science department in the country. The many ground-breaking areas of theoretical computer science chartered by his academic descendants are legend.
Starting from his early research on the inherent limitations of computing devices, Blum's work has developed around a single unifying theme—finding positive, practical consequences of living in a world where all computational resources are bounded. He showed that secure business transactions and pseudo-random number generation are possible because all computational devices have finite resources.
Ph.D., Masters and Bachelors, Massachusetts Institute of Technology.
Research Area: Trustworthy Computing Platforms and Devices
Researcher: Manuel BlumResearchers: Manuel Blum, Luis von Ahn
"Human Computable Passwords". J. Blocki, M. Blum, A. Datta, and S. Vempala, 2014.
"GOTCHA Passwork Hackers!".
Datta, A., Blocki, J., & Blum, M. (2013). ACM: Proceedings of the Annual Conference.
"Naturally Rehearsing Passwords".
Datta, A., Blocki, J., & Blum, M. (2013). ASIACCS: Proceedings of the ACM Symposium on Information, Computer and Communication Security.