International Association for Cryptologic Research

IACR News Central

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.

You can also access the full news archive.

Further sources to find out about changes are CryptoDB, ePrint RSS, ePrint Web, Event calender (iCal).

2013-09-04
13:32 [Event][New] Crypto 2014

  From August 17 to August 21
Location: Santa Barbara, USA
More Information: http://www.iacr.org/conferences/crypto2014/




2013-09-03
20:48 [Job][New] Junior Professorship in Mobile Security, Ruhr-Universität Bochum, Germany

  The Faculty of Electrical Engineering and Information Technology at the Ruhr-Universität Bochum invites applications for the position of a Junior Professorship for Mobile Security.

The future occupant of the position Mobile Security represents the department in this field in research and teaching. The appointment will be at the rank of an assistant professor.

His/her scientific work should focus on one or more of the following key research areas:

- Security of mobile systems at the hard- or software level

- Security aspects of new application domains (especially cyber-physical systems)

- Reverse engineering of hardware and software systems

- Security aspects of distributed systems

- Secure and dependable software systems

A doctoral degree of outstanding quality and evidence of special aptitude in teaching are just as much required as the willingness to participate in the self-governing bodies of the RUB. Furthermore, we expect the candidate to generally get involved in university processes according to RUB’s mission statement. Beside the specific skills the candidate should have a profound didactical qualification to develop new learning environments such as research oriented teaching.

We expect furthermore readiness to participate in interdisciplinary academic work, willingness and ability to attract external funding, ability to work in teams, and the will to participate in collaborative research.

The Ruhr-Universität Bochum is an equal opportunity employer.

06:30 [Event][New] CS2-2014: First Workshop on Cryptography and Security in Computing Syste

  Submission: 27 October 2013
Notification: 29 November 2013
From January 20 to January 20
Location: Vienna, Austria
More Information: http://www.cs2.deib.polimi.it/




2013-08-30
21:47 [Job][New] UTRCI Research Scientist, Cyber-physical Systems Security , United Technologies Research Centre, Cork - Ireland

  UTRCI seeks candidates with expertise in cyber-physical security, wireless sensor networks and embedded systems to join their Networks & Embedded Systems group in Cork, Ireland. The successful candidates are expected to coordinate and primarily execute R&D activities within international projects on cyber-physical systems security. UTRC is developing capability in cyber-physical security to apply to the full range of UTC (http://www.utc.com) products and programs.

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.

21:46 [Job][New] Ph.D.student, Hochschule Furtwangen University, Germany, EEA

  Hochschule Furtwangen University, Germany, Two Full-time Ph.D. Positions

* 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

21:43 [Event][New] SHA3: The 2014 SHA3 Workshop

  Submission: 12 April 2014
Notification: 13 June 2014
From August 22 to August 23
Location: Santa Barbara, California, USA
More Information: http://csrc.nist.gov/groups/ST/hash/sha-3/Aug2014/SHA3-aug2014-call-for-papers.pdf


15:17 [Pub][ePrint] On the security of a password-only authenticated three-party key exchange protocol, by Junghyun Nam and Kim-Kwang Raymond Choo and Juryon Paik and Dongho Won

  This note reports major previously unpublished security vulnerabilities in the password-only authenticated three-party key exchange protocol due to Lee and Hwang (Information Sciences, 180, 1702-1714, 2010): (1) the Lee-Hwang protocol is susceptible to a man-in-the-middle attack and thus fails to achieve implicit key authentication; (2) the protocol cannot protect clients\' passwords against an offline dictionary attack; and (3) the indistinguishability-based security of the protocol can be easily broken even in the presence of a passive adversary.



15:17 [Pub][ePrint] Lattice-Based FHE as Secure as PKE, by Zvika Brakerski and Vinod Vaikuntanathan

  We show that (leveled) fully homomorphic encryption (FHE) can be based on the hardness of $\\otild(n^{1.5+\\epsilon})$-approximation for lattice problems (such as GapSVP) under quantum reductions for any $\\epsilon>0$ (or $\\otild(n^{2+\\epsilon})$-approximation under classical reductions). This matches the best known hardness for ``regular\'\' (non-homomorphic) lattice based public-key encryption up to the $\\epsilon$ factor. A number of previous methods had hit a roadblock at quasipolynomial approximation. (As usual, a circular security assumption can be used to achieve a non-leveled FHE scheme.)

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.



15:17 [Pub][ePrint] Searching for Nonlinear Feedback Shift Registers with Parallel Computing, by Przemysław Dąbrowski and Grzegorz Łabuzek and Tomasz Rachwalik and Janusz Szmidt

  Nonlinear feedback shift registers (NLFSRs) are used to construct pseudorandom generators for stream ciphers. Their theory is not so complete as that of linear feedback shift registers (LFSRs). In general, it is not known how to construct all NLFSRs with maximum period. The direct method is to search for such registers with suitable properties. Advanced technology of parallel computing has been applied both in software and hardware to search for maximum period NLFSRs having a fairly simple algebraic normal form.



15:17 [Pub][ePrint] Cryptanalysis of the SIMON Family of Block Ciphers, by Hoda A. Alkhzaimi and Martin M. Lauridsen

  Recently, the U.S National Security Agency has published the specifications of two families of lightweight block ciphers, SIMON and SPECK, in ePrint report 2013/404. The ciphers are developed with optimization towards both hardware and software in mind. While the specification paper discusses design requirements and performance of the presented lightweight ciphers thoroughly, no security assessment is given. This paper is a move towards filling that cryptanalysis gap for the SIMON family of ciphers. We present a series of observations on the presented construction that, in some cases, yield attacks, while in other cases may provide basis of further analysis by the cryptographic community. Specifically, we obtain attacks using classical- as well as truncated differentials. In the former case, we show how the smallest version of SIMON, Simon32/64, exhibits a strong differential effect.



15:17 [Pub][ePrint] Warrant-Hiding Delegation-by-Certificate Proxy Signature Schemes, by Christian Hanser and Daniel Slamanig

  Proxy signatures allow an entity (the delegator) to delegate his signing capabilities to other entities (called proxies), who can then produce signatures on behalf of the delegator. Typically, a delegator may not want to give a proxy the power to sign any message on his behalf, but only messages from a well defined message space. Therefore, the so called delegation by warrant approach has been introduced. Here, a warrant is included into the delegator\'s signature (the so called certificate) to describe the message space from which a proxy is allowed to choose messages to produce valid signatures for. Interestingly, in all previously known constructions of proxy signatures following this approach, the warrant is made explicit and, thus, is an input to the verification algorithm of a proxy signature. This means, that a verifier learns the entire message space for which the proxy has been given the signing power. However, it may be desirable to hide the remaining messages in the allowed message space from a verifier. This scenario has never been investigated in context of proxy signatures, but seems to be interesting for practical applications. In this paper, we resolve this issue by introducing so called warrant-hiding proxy signatures. We provide a formal security definition of such schemes by augmenting the well established security model for proxy signatures by Boldyreva et al. Furthermore, we discuss strategies how to realize this warrant-hiding property and we also provide two concrete instantiations of such a scheme. They enjoy different advantages, but are both entirely practical. Moreover, we prove them secure with respect to the augmented security model.