Assistant Professor, Stevens Institute of Technology, Hoboken, NJ, USA
The Computer Science Department at Stevens Institute of Technology invites applications for a tenure-track position beginning in August 2012. Special consideration will be given to candidates in machine learning or secure systems at the assistant professor level. However, outstanding applicants at other levels and/or in other areas of Computer Science may also be considered. Applicants are expected to have a Ph.D. in Computer Science or a closely related field, a record that suggests the potential to achieve national prominence in research, and a strong commitment to teaching. A successful candidate will be expected to conduct a vigorous, externally funded research program and to teach and innovate curricula at both the undergraduate and graduate levels.
Stevens Institute of Technology is a private university located in Hoboken, New Jersey. The 55-acre campus is on the Hudson river across from midtown Manhattan within a few minutes from NYC via public transportation. Hoboken is an upscale small city, the residence of choice for many professionals working in NYC. Faculty live in Hoboken, Manhattan, and in suburban communities in Northern New Jersey along commuter train lines to Hoboken and NYC. Stevens\\\' location offers excellent opportunities for collaborations with nearby universities such as NYU, Princeton, Columbia, and Rutgers/DIMACS as well as major industrial research laboratories such as Bell Labs, AT&T Labs, IBM Research, Google New York, Siemens, and the Sarnoff Corporation. Stevens is an Affirmative Action/Equal Opportunity employer.
Review of applications will begin on September 15, 2011.
Ero Balsa: Privacy in online social networks: analysis and solutions
Privacy in online social networks: analysis and solutions
Online social networks have revolutionized the way people communicate, meet, share information, and socialize both in their private and professional lives. Although these developments have brought unquestionable benefits to society, users are increasingly worried about the lack of control over their private information. The ease with which information is propagated over the Internet has led to a new reality where the acquisition of personal data is easier than never before. Solutions that provide users with the ability to benefit from social networking technologies while offering well-understood privacy properties have not yet been developed.\r\n\r\n
\r\nTo better understand privacy risks in social networks I will develop methodologies to systematically analyze these risks by capturing information leakages in the various components of the system, including content as well as traffic data. This will involve defining models for user behavior, adversarial knowledge and capabilities, as well as metrics to quantify the degree to which privacy requirements are satisfied. Based on the understanding of how privacy breaches are enabled by information flows in social networ[...]
Scott Russell: Communication and Query Privacy: Intrusion-Resilient Secure Channels and Private Database Queries
Communication and Query Privacy: Intrusion-Resilient Secure Channels and Private Database Queries
One part of this dissertation describes a new two-party communication primitive we call an Intrusion-Resilient Secure Channel (IRC) that offers improved confidentiality over traditional secure channels against passive but mobile, highly adaptive adversaries. IRCs limit the loss of confidentiality resulting from the exposure of parties’ secret keys by utilizing key-evolution and proactive security techniques similar to those employed in intrusion-resilient signature schemes. We show how to construct an IRC using existing chosen-ciphertext-secure public-key cryptosystems in a black-box manner. We also discuss how to use IRCs to improve two-party protocol security; as a concrete example, we prove an IRC-augmented version of the Itkis-Reyzin intrusion-resilient signature scheme secure against highly adaptive adversaries capable of exposing even expired secrets.\r\n\r\n
The second part describes an interactive binary search protocol with user and server privacy provided that improves upon an existing user-private only protocol. We utilize our search protocol to construct user- and server-private protocols for predecessor, successor, and simple range queries on one-dimensional dat[...]