[cs-talks] Upcoming CS Seminars: BUSec (Weds) + Gurari PhD Proposal (Thurs) + Erdos PhD Proposal (Fri)

Conroy, Nora Mairead conroynm at bu.edu
Tue Jan 20 11:33:29 EST 2015

Practice talk: Sorting and Searching Behind the Curtain

Foteini Baldimtsi, BU

Wednesday January 21, 2015 at 10am in MCS 180 - Hariri

Abstract: We study the problem of private outsourced sorting of encrypted data. We start by proposing a novel sorting protocol that allows a user to outsource his data to a cloud server in an encrypted form and then request the server to perform computations on this data and sort the result. To perform the sorting the server is assisted by a secure coprocessor with minimal computational and memory resources. The server and the coprocessor are assumed to be honest but curious, i.e., they honestly follow the protocol but are interested in learning more about the user data. We refer to the new protocol as private outsourced sorting since it guarantees that neither the server nor the coprocessor learn anything about user data as long as they are non-colluding. We formally define private outsourced sorting and provide an efficient construction that is based on semi-homomorphic encryption.  As an application of our private sort, we present MRSE: the first scheme for outsourced search over encrypted data that efficiently answers multi-term queries with the result ranked using frequency of query terms in the data, while maintaining data privacy. To construct MRSE we use searchable encryption techniques combined with our new private sort framework. Finally, although not discussed in this work, we believe that our private sort framework can turn out to be an important tool for more applications that require outsourced sorting while maintaining data privacy, e.g., database queries.  Joint work with Olga Ohrimenko

PhD Thesis Proposal
Danna Gurari, BU
IVC Research Group
Thursday, January 22, 2015 at 9am in MCS 148

Abstract: Advances in image acquisition and storage technologies have led to many image-based experiments that are designed to systematically study basic science processes.  This thesis centers on the design of image annotation methods to accelerate the transition from data collection to scientific discovery.  The focus is on biomedical images in an effort to contribute to research that addresses society’s health care problems.  The first half of the work includes a detailed analysis of the relative strengths and weaknesses of three different approaches to demarcate object boundaries in images: by experts, by crowdsourced laymen, and by automated computer vision algorithms.  Results revealed that popular computer vision algorithms and state-of-art human computation crowdsourcing systems come with unique strengths but both methods were insufficient alone to yield the desired accuracy and scale to support quantitative analyses.  These results inspired a research trajectory for gaining traction on this problem by examining how to effectively integrate computer vision algorithms and crowdsourced laymen in order to achieve expert-level annotation at scale.  Results from two implemented hybrid crowdsourcing-computer methods are compared to annotations of experts, two pure crowdsourcing methods, and two pure algorithmic methods on 405 objects in everyday and biomedical images.  Experiments revealed that a hybrid system design yielded the most accurate results among the six system configurations and it yielded an accuracy that is statistically similar to segmentations created by biomedical experts.  The final chapter of this proposal includes a case study that will underscore the potential for this hybrid algorithm-crowdsourcing approach to accelerate big data computational biology analyses.  A system will be built that incorporates this approach and show how it creates an expert-quality 3D volume reconstruction of fish structures.  This work will support analyses that link biological structure and function.  To encourage community-wide effort to continue working on developing methods and systems for image-based studies which can have real and measurable impact that benefit society at large, datasets and code are publicly-shared (http://www.cs.bu.edu/~betke/BiomedicalImageSegmentation/).

PhD Proposal
Group Centrality for Repetition-Aware Content Placement
Dora Erdos, BU
Friday, January 23, 2015 at 10am in MCS 148

Abstract: In this talk I am going to  focus on the problem of identifying central nodes in repetition aware environments. Arguably, the most effective technique to ensure wide adoption of a concept (or product) is by repeatedly exposing individuals to messages that reinforce the concept (or promote the product). We propose a novel framework for the effective placement of content: Given the navigational patterns of users in a network, e.g., web graph, hyperlinked corpus, or road network, and given a model of the relationship between content-adoption and frequency of exposition, we define the repetition-aware content-placement problem as that of identifying the set of B nodes on which content should be placed so that the expected number of users adopting that content is maximized. The key contribution of our work is the introduction of memory into the navigation process, by making user conversion dependent on the number of her exposures to that content. This dependency is captured using a conversion model that is general enough to capture arbitrary dependencies. Our solution to this general problem builds upon the notion of absorbing random walks, which we extend appropriately in order to address the technicalities of our definitions.  This paper is characteristic of my work on group centrality and will be part of my thesis. In the talk I will also give a brief overview of my thesis which consists of two main topics; centrality measures and the analysis of dot-product graphs.

Evimaria Terzi
Azer Bestavros
Pauli Miettinen
Mark Crovella
George Kollios
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs-mailman.bu.edu/pipermail/cs-talks/attachments/20150120/5c1519ca/attachment.html>

More information about the cs-talks mailing list