Benjamin W. Fuller


Benjamin FullerBenjamin W. Fuller
Lincoln Laboratory
Massachusetts Institute of Technology
Secure Resilient Systems and Technology Group
244 Wood Street
Lexington, MA 02420-9108
voice: 781-981-4438
email: bfuller@ll.mit.edu

 

Dr. Benjamin Fuller is a member of the technical staff in the Secure Resilient Systems and Technology Group at MIT Lincoln Laboratory. His research focuses on cryptography and practical solutions to secure systems. He has developed efficient group key distribution techniques for tactical networks. This work, which spanned research, implementation, and testing in real networks, produced several publications, including "ASE: Authenticated Statement Exchange," which won best paper at the IEEE International Symposium on Network Computing and Applications in 2010. The follow-on architecture, Lincoln Open Cryptographic Key Management Architecture, was a 2012 R&D 100 Award winner.

Prior to joining Lincoln Laboratory in 2007, Dr. Fuller worked at IBM and the National Security Agency. While at the Laboratory, he completed his PhD degree at Boston University under the direction of Professor Leonid Reyzin. His research focused on cryptography with imperfect and noisy randomness: What can be achieved cryptographically when only imperfect randomness is available? Imperfect randomness arises in two distinct situations: (1) compensating for the bias of hardware random number generators and (2) overcoming partial adversary knowledge of secret state. Dr. Fuller's master's thesis, "Computational Entropy and Information Leakage," focused on this problem. The second thread of his research was cryptography with noisy secrets. Noisy secrets arise in two important applications: biometrics and physical unclonable functions. In both of these applications, noisy readings are made from a physical phenomenon that changes over time. These applications present a promising alternative to passwords. This research culminated in Dr. Fuller’s PhD dissertation “Strong Key Derivation from Noisy Sources.”

Dr. Fuller’s current work centers on allowing distrusting parties to engage in limited information sharing. He has developed new protocols for multiparty computation and searchable encryption.

Dr. Fuller earned a BS degree in mathematics and computer science from Rensselaer Polytechnic Institute in 2006, an MA degree in computer science from Boston University in 2011, and a PhD degree in computer science from Boston University in 2015. 

 

top of page