כרמית חזאי (אונ' בר-אילן)
יום רביעי, 25.6.2014, 11:30
The problem of securely outsourcing computation to an untrusted server gained momentum with the recent penetration of cloud computing services. The ultimate goal in this setting is to design efficient protocols that minimize the computational overhead of the clients and instead rely on the extended resources of the server. In this talk, we will focus on the outsourced pattern matching problem which is highly motivated in the context of delegatable computing since it offers storage alternatives for massive databases that may contain confidential data. More explicitly, we will describe two different solutions for this problem and will highlight the difficulty of designing secure protocols for this problem by further demonstrating a lower bound.
Carmit has joined the Computer Engineering Department in the Faculty of Engineering in Bar-Ilan University two years ago, after spending two years as a postdoctoral researcher at the Computer Science Department in Aarhus University, Denmark. Before that she was a postdoctoral in Weizmann Institute and IDC Herzliya. She received her Ph.D. in Computer Science from Bar-Ilan University in 2009. Her Ph.D. research results were published in a book about efficient secure two-party computation.