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[...]
Postdoctoral Researcher, University of Maryland
I will have a postdoc position available in my group starting Sept. 1. This will be a 1-year position, with the possibility of extending it to a second year. Shorter-term visits, or start dates after Sept. 1, can also be considered.
The position is fairly open. In particular, I would encourage applicants who work on more applied aspects of computer/network security in addition to those who work on cryptography. Students in the areas of information theory, game theory, or complexity-theoretic aspects of cryptography will also be considered.
If you are interested, please send me an email with a copy of your CV, a short research statement, and the name of at least one reference.
Lecturer, Queensland University of Technology, Brisbane, Australia
The Queensland University of Technology (QUT) in Brisbane, Australia, invites applications for full-time Lecturer positions starting in 2012. Areas of interest include cryptography, information security, network security, and digital forensics.
Appointee(s) will undertake their research in QUT\'s Information Security Institute, a multi-disciplinary institute bringing together information security researchers from computer science, mathematics, engineering, business, and law, with a leading national profile and strong international links.
Applicants should have completed (or be under examination for) a PhD in computer science, mathematics, or a related area and be early career researchers (less than three years in an academic role). Appointee(s) will develop and maintain an active research program, teach at undergraduate and graduate levels, supervise research students, and participate in QUT\'s Early Career Academic Development program.
Miroslav Knezevic: Efficient Hardware Implementations of Cryptographic Primitives
Efficient Hardware Implementations of Cryptographic Primitives
Society is undergoing a paradigm shift where the Information and Communication Technology (ICT) revolution goes along with the evolution of the humankind. The Internet is all around us and plays a crucial role in our ability to communicate. We often distribute our personal and other classified information using the benefits of the global network. Our demands to conceal confidential data are therefore being strongly manifested and become very important. By ensuring the objectives of information security, such as confidentiality, data integrity, entity authentication, non-repudiation, and many more, cryptography provides a natural solution to the issue of data protection.\r\n
\r\nThe ICT revolution has driven cryptography from the art of secret writing into a multidisciplinary scientific study of techniques for securing digital information. While providing aspects of information security, cryptography uses complex mathematical objects and often represents a bottleneck in hardware and software implementations. The research presented in this thesis deals with efficient hardware implementations of cryptographic primitives.\r\n
\r\nThe first part of the thesis is devoted to efficient[...]