Mike Rosulek, assistant professor of computer science, was selected for a Google Research Award for a grant to advance methods of customer privacy. The award will allow Rosulek to hire a graduate student to work on the project, and give them the opportunity to collaborate with Google researchers and engineers.

“I have lots of ideas in this space, and it will allow me and a student to dive in head first exploring them,” Rosulek says.

Companies are looking for inexpensive ways to share information with each other without violating the privacy of their customers. For example, two companies may want to find out which customers they have in common. A tool from cryptology called private set intersection allows two parties to find items in common on two separate lists without revealing anything else from those lists.

One part of Rosulek’s research seeks to strengthen the security of private set intersection tools while keeping the costs reasonable so that companies are more likely to adopt good practices for keeping their customer’s information secure.

Another part of the project will work on flexible (or “fuzzy”) matching of items on lists such as addresses. Names and street addresses may have differences in spelling, so looking for exact matches between two sets can be too restrictive. Rosulek’s research will seek to modify current techniques to allow for “close enough” matches.

“I’m excited to see that Google is interested in these advanced cryptographic tools. I’m excited that the techniques can be used to protect sensitive user information. And I’m excited about the new technical and mathematical challenges on the roadmap,” Rosulek says.