Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also get this service via
To receive your credentials via mail again, please click here.
The three open positions are:
Applications are invited for one PhD studentship in the Security Group at the Computer Laboratory to work with Dr Steven Murdoch. Funding for this position is provided by Microsoft Research Cambridge and Research Councils UK through the Dorothy Hodgkin Postgraduate Awards scheme. As such, applicants must be nationals from India, China, Hong Kong, South Africa, Brazil, Russia or countries in the developing world as defined by the Development Assistance Committee of the OECD: http://www.oecd.org/dataoecd/32/40/43540882.pdf
The successful candidate will undertake research in the field of anonymous communications and privacy enhancing technologies. This broad research area provides considerable scope for the PhD candidate to find his or her own research direction.
The objective is to explore how we can make mobile payment systems dependable despite the presence of malware. Research topics include the design of next-generation secure element hardware, trustworthy user interfaces, and mechanisms to detect and recover from compromise. Relevant skills include Android, payment protocols, human-computer interaction, hardware and software security, and cryptography.
Cryptographic protocols form the backbone of our digital society. Unfortunately, the security of numerous critical components has been neglected. As a consequence, attacks have resulted in financial loss, violations of personal privacy, and threats to democracy. This thesis aids the secure design of cryptographic protocols and facilitates the evaluation of existing schemes.\r\n\r\n
Developing a secure cryptographic protocol is game-like in nature, and a good designer will consider attacks against key components. Unlike games, however, an adversary is not governed by the rules and may deviate from expected behaviours. Secure cryptographic protocols are therefore notoriously difficult to define. Accordingly, cryptographic protocols must be scrutinised by experts using procedures that can evaluate security properties.\r\n\r\n
This thesis advances verification techniques for cryptographic protocols using formal methods with an emphasis on automation. The key contributions are threefold. Firstly, a definition of election verifiability for electronic voting protocols is presented; secondly, a definition of user-controlled anonymity for Direct Anonymous Attestation is delivered; and, finally, a procedure to automatically evaluate observational equivalence is introduced.\r\n\r\n
This work enables security properties of cryptographic protocols to be studied. In particular, we evaluate security in electronic voting protocols and Direct Anonymous Attestation schemes; discovering, and fixing, a vulnerability in the RSA-based Direct Anonymous Attestation protocol. Ultimately, this thesis will help avoid the current situation whereby numerous cryptographic protocols are deployed and found to be insecure.[...]
Candidates must hold a PhD in mathematics, computer science or related areas. Furthermore, they must have a demonstrated record of top-quality research in foundations of public-key cryptography. This is usually proved by publications in IACR conferences or workshops.
Please send your application per email (preferably as PDF) to Eike Kiltz (eike.kiltz at rub.de). The application should include a full CV, a cover letter motivating you application, a short description of your two best research articles, and at least two candidates for reference letters. Review of applications will begin immediately and will continue until the position is filled, the starting date is flexible.