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).

2012-08-24
23:03 [News] IACR BibTeX file available

  There is now a BibTeX file available that contains all IACR publications in cryptodb.



2012-08-23
11:08 [Job][New] Ph.D. student, University of Trier, Germany

 

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:

  • Curriculum Vitae (including your contact address and work experience)
  • Cover letter explaining your motivation
  • Transcript of all courses and grades for your Bachelor and Master program
  • A short description of your Master’s work (max 1 page)
  • Contact details of (at least) one professor that can provide a recommendation for your application.

The deadline for applications is September 30th, 2012. However, late applications will be considered until the position is filled.

11:08 [Job][New] Assistant Professor, Kanazawa University, Japan

  Kanazawa University, Japan, invites applications for a tenure-track assistant professor position in advanced research area of information security, such as IT Security and Cryptography.

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.

11:08 [Job][New] Faculty position (Professur, W2) , Saarland University, Center for IT-Security, Privacy and Accountability

  We seek excellent applicants from all areas of IT-security, privacy and accountability, in particular in the areas of

• 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

11:08 [Job][New] PhD student, University of Luxembourg

  The University of Luxembourg seeks to hire an outstanding researcher for the Applied Security and Information Assurance group (APSIA, led by Prof. Peter Ryan) at its Interdisciplinary Centre for Security, Reliability and Trust (SnT). SnT is a recently formed centre carrying out interdisciplinary research in secure, reliable and trustworthy ICT systems and services, often in collaboration with industrial, governmental or international partners. The APSIA group is also associated with Laboratory of Algorithmics, Cryptology and Security (LACS) of the Computer Science and Communications Research Unit (CSC), which is part of the international and multidisciplinary Faculty of Science, Technology and Communication (FSTC) in University of Luxembourg.


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.

11:07 [Event][New] Workshop on Real-World Cryptography

  From January 9 to January 11
Location: Palo Alto, United States
More Information: https://crypto.stanford.edu/RealWorldCrypto/index.php


11:07 [Event][New] WCC 2013: International Workshop on Coding and Cryptography

  Submission: 21 December 2012
Notification: 1 February 2013
From April 15 to April 19
Location: Bergen, Norway
More Information: http://www.selmer.uib.no/WCC2013/


11:06 [Event][New] ANTE: Annals of Telecommunications: Special Issue on: Privacy-aware electronic so

  Submission: 1 October 2012
From July 1 to December 31
More Information: http://www-public.it-sudparis.eu/~lauren_m/Special-Issue/CfP_privacy_aware_electronic_society-2012.pdf


00:17 [Pub][ePrint] Cryptanalysis of Two Dynamic ID-based Remote User Authentication Schemes for Multi-Server Architecture, by Ding Wang, Chun-guang Ma, De-li Gu and Zhen-shan Cui

  Understanding security failures of cryptographic protocols is the key to both patching existing protocols and designing future schemes. In NSS\'10, Shao and Chin showed that Hsiang and Shih\'s dynamic ID-based remote user authentication scheme for multi-server environment is vulnerable to server spoofing attack and fails to preserve user anonymity, and further proposed an improved version which is claimed to be efficient and secure. In this study, however, we will demonstrate that, although Shao-Chin\'s scheme possesses many attractive features, it still cannot achieve the claimed security goals, and we report its following flaws: (1) It cannot withstand offline password guessing attack under their non-tamper resistance assumption of the smart card; (2) It fails to provide user anonymity; (3) It is prone to user impersonation attack. More recently, Li et al. found that Sood et al.\'s dynamic ID-based authentication protocol for multi-server architecture is still vulnerable to several kinds of attacks and presented a new scheme that attempts to overcome the identified weaknesses. Notwithstanding their intentions, Li et al.\'s scheme is still found vulnerable to various known attacks by researchers. In this study, we perform a further cryptanalysis and uncover its two other vulnerabilities: (1) It cannot achieve user anonymity, the essential goal of a dynamic ID-based scheme; (2) It is susceptible to offline password guessing attack. The proposed cryptanalysis discourages any use of the two schemes under investigation in practice and reveals some subtleties and challenges in designing this type of schemes.



00:17 [Pub][ePrint] Exploiting Collisions in Addition Chain-based Exponentiation Algorithms, by Neil Hanley and HeeSeok Kim and Michael Tunstall

  Public key cryptographic algorithms are typically based on group exponentiation algorithms, and many algorithms have been proposed in the literature based on addition chains. We describe attacks based on collisions of variables manipulated in group operations extending attacks described in the literature. The advantage of our attacks over previous work is that the attacks can be applied to a single trace and do not require any knowledge of the input to the exponentiation algorithm. Moreover, we prove that our attacks are applicable to all addition chain-based exponentiation algorithms. This means that a side channel resistant implementation of a group exponentiation will require countermeasures that introduce enough noise that an attack is not practical.



00:17 [Pub][ePrint] Computational Soundness without Protocol Restrictions, by Michael Backes and Ankit Malik and Dominique Unruh

  The abstraction of cryptographic operations by term algebras, called

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

verification tools.

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.