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 candidate should have a solid background in vulnerability assessment and thorough knowledge of best practices in countermeasures and design processes for secure systems, for example, encryption, authentication and anomaly detection. A successful candidate would also have a solid background in embedded systems and cyber-physical systems with past experience in applying cyber-physical security concepts to the particular constraints of embedded systems, including scalability of countermeasures. Practical experience in identifying and demonstrating both vulnerabilities and countermeasures is highly desirable for this position.
Candidates should have a proven track record of research (top journals and conferences) in cyber-security or cyber-physical security.
The ideal candidate is a self-starter who works well in an international teaming environment, is extremely well-organized and has excellent interpersonal, leadership and communication skills. Besides technical excellence, an entrepreneurial attitude towards innovation is essential.
The candidate should have a PhD in Computer Science, Electrical and Computer Engineering or related fields, with particular expertise in Cyber-Physical Systems and Wireless Sensor Networks. The candidate should also have a strong international publication record and demonstrated ability to do independent research. Fluency in written and spoken English is required.
* The Chair for Security in Distributed Systems, computer science Hochschule Furtwangen, Germany, offers two full-time PhD positions
* The position involves research in the area of IT-security within the BMBF project
ProSeCCo \\\'Promotionsvorhaben zur Erarbeitung von Sicherheitserweiterungen für das
Cloud Computing\\\' in cooperation with the Albert-Ludwig University of Freiburg at the \\\'Institut für Informatik und Gesellschaft (IIG) - Telematik\\\' (Prof. Dr.
Günter Müller) and the university of Karlsruhe (KIT) at the \\\'Institut for Kryptographie und Sicherheit (IKS) (Prof. Dr. Jörn Müller-Quade).
The successful candidate is expected to contribute to research in IT-Security and applied cryptography for Cloud Security.
Besides other cloud security related aspects topics of interest for the two open positions are
- application of homomorphic cryptographic primitives for secure cloud storage,
- monitoring- and attestation mechanisms to control information flow between VMs.
* The position is available from November on and is fully funded. The salary scale for both positions is TV-L E13.
The gross income depends on the candidate\\\'s experience level. At the lowest level it corresponds to approx. 40,000 EUR per year.
* Contracts are initially offered for two years. An extension is possible.
* She or he is given the possiblity to carry out a Ph.D.
* The successful candidate should have a Master\\\'s degree in Computer Science, Mathematics, Information Security, or a related field.
Deep Knowledge in cryptography is not a must but an asset.
* The deadline for applications is September 20, 2013. However, late applications will be considered until the position is filled.
Please send your application with reference number 11
Our approach consists of three main ideas: Noise-bounded sequential evaluation of
high fan-in operations; Circuit sequentialization using Barrington\'s Theorem; and finally,
successive dimension-modulus reduction.
We analyze the computational and communication complexities of our construction, and show that it is much more efficient than the existing protocols in the literature.
Finally, we show that our basic protocol is efficiently transformed into a stronger protocol secure in the presence of malicious adversaries, together with performance and security analysis.
cryptographic primitive in parallel to the execution of the operations. The result of the division are two primitives that have smaller input sizes and thus require lower attack complexities.
However, the division is not completely independent and the sub-primitives depend (output of one is the input for the other) mutually on a certain number of bits. When the number of such bits is relatively small, we show a technique based on three classical meet-in-the-middle attacks that can recover the secret key of the cipher faster than an exhaustive search. We apply our findings to the lightweight block cipher KLEIN and show attacks on 10/11/13 rounds of KLEIN-64/-80/-96.
Our approach requires only one or two pairs of known plaintexts and always recovers the secret key.