Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also receive updates via:
To receive your credentials via mail again, please click here.
You can also access the full news archive.
The PhD candidate will contribute to the research in the project “Implementation-Level Analysis of E-Voting Systems”, which is funded by the German Research Foundation (DFG) and is part of the DFG priority programme “Reliably Secure Software Systems - RS3”. The goal of this project is to develop general methods and techniques for the security analysis of Java systems that use cryptography, with e-voting systems being one of the motivating examples. The project combines techniques from program analysis/verification with techniques from cryptography and cryptographic protocol analysis.
We offer a creative international environment and the possibility to participate in internationally visible research. The salary scale for the position is TV-L E13 (100%). Subject to the final decision of the DFG, the position will be available from October 1st, 2012. Contracts are initially offered for two years, with the perspective of an extension by another two years.
The successful candidate should have a Master’s degree (or should be very close to completion thereof) in Computer Science, Mathematics, Information Security, or a related field, with a strong background in Theoretical Computer Science. Knowledge in program analysis/verification, logic, or cryptography is an asset. Good English skills are expected; knowledge of German is not required.
Applications should include:
The deadline for applications is September 30th, 2012. However, late applications will be considered until the position is filled.
An appointee is expected on duty on December 1st, 2012 or at a possibly early time after that, and at latest by the end of March, 2013.
Research budget: Kanazawa University will provide funding support for the start-up of research: 10 million Yen for the first fiscal year and 5 million Yen for the second fiscal year.
• Privacy Enhancing Technologies;
• Language-based Security;
• Information Trust and Accountability;
• Network-, System- and Web-Security.
The position is part of the recently established IT-security center CISPA, which was established as part of an initiative by the German government to create three distinguished research centers in IT-security. CISPA covers a broad area of research problems in IT-security, privacy, and accountability, ranging from fundamental research questions to the development of new technologies and prototypic systems for practical application. The close connection of the CISPA to the department of computer science, the Max-Planck-Institute (MPI) for Informatics, the MPI for Software Systems, the German Research Center for Artificial Intelligence (DFKI), the Cluster of Excellence on Multimodal Computing and Interaction (MMCI), the Saarbrücken Graduate School of Computer Science and the Intel Visual Computing Institute (IVCI) is crucial for the success of the location. All of these institutes are in close proximity on the campus.
Aside from the standard requirements by public sector employment law, necessary qualifications for hiring include outstanding scientific skills, management skills and excellent teaching skills. The scientific qualification should encompass a doctoral degree as well as publications in the leading international IT-security conferences. The teaching and working language is English. Participation towards establishing the CISPA center and the acquisition of projects is expected.
The employment is tenured and initially a private-law employment relationship. A change to civil servant status is planned for the next year, as soon as the requirements by the budget and the civil service law are fulfilled.
The official version of the job advertisement can
The PhD topic is related to investigate efficient and secure mechanisms for individuals and organisations to outsource their data and related operations to third-party service providers. The research focus will mainly be on (but not limited to) cryptographic encryption schemes, which provide rigorous security properties yet allow authorized parties to directly search over the ciphertexts. The candidate is expected to design new schemes, analyse their security properties, and investigate the practical performances of the solutions.
Dolev-Yao models, is essential in almost all tool-supported methods
for verifying security protocols. Recently significant progress was
made in establishing computational soundness results: these results
prove that Dolev-Yao style models can be sound with respect to actual
cryptographic realizations and security definitions. However, these
results came at the cost of imposing various constraints on the set of
permitted security protocols: e.g., dishonestly generated keys must
not be used, key cycles need to be avoided, and many more. In a
nutshell, the cryptographic security definitions did not adequately
capture these cases, but were considered carved in stone; in contrast,
the symbolic abstractions were bent to reflect cryptographic features
and idiosyncrasies, thereby requiring adaptations of existing
In this paper, we pursue the opposite direction: we consider a
symbolic abstraction for public-key encryption and identify two
cryptographic definitions called PROG-KDM (programmable key-dependent
message) security and MKE (malicious-key extractable) security that we
jointly prove to be sufficient for obtaining computational soundness
without imposing assumptions on the protocols using this
abstraction. In particular, dishonestly generated keys obtained from
the adversary can be sent, received, and used. The definitions can be
met by existing cryptographic schemes in the random oracle model. This
yields the first computational soundness result for trace-properties
that holds for arbitrary protocols using this abstraction (in
particular permitting to send and receive dishonestly generated keys),
and that is accessible to all existing tools for reasoning about
Dolev-Yao models without further adaptations.