Efficient Oblivious Automata Evaluation and Its Application

August 30, 2011
Payman Mohassel | University of Calgary

Oblivious Automata Evaluation allows two parties -a client who holds an input string X and a server who holds an Automata G- to learn the result of evaluating G on X but nothing else. In this talk, I will describe a simple and efficient, secure two-party construction for this problem. I will also explain some applications of our construction to pattern matching and intrusion detection. Finally, I report on the results of some experiments based on a prototype implementation.

Joint work with Salman Niksefat and Saeed Sadeghian.

Speaker Details

Payman Mohassel is an assistant professor in the Department of Computer Science at University of Calgary. He received his Ph.D. from University of California Davis, in 2009 under the supervision of Matthew Franklin. His research interests are in both practical and theoretical aspects of cryptography, and information security. Some of his more recent projects include “efficient and privacy-preserving computation”, “provably secure encryption and signature schemes”, and “privacy in genomic computation”.