International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) You can also receive updates 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).

17:15 [Job][New] Lecturer, University of Cape Town


The Department of Mathematics and Applied Mathematics at the University of Cape Town is a large and dynamic establishment with over thirty faculty members. We seek to make one new appointment in Mathematics or Applied Mathematics at the level of Lecturer. Applications in all areas of Mathematics and Applied Mathematics will be considered.

Requirements include: A PhD in the mathematical sciences. (Scientific publications, postdoc, teaching experience and student supervision are all advantageous.)

Responsibilities include: Teaching and developing undergraduate as well as postgraduate courses in mathematics (within and beyond the science faculty). Developing and pursuing an active research program, which includes student supervision. Course convening, departmental and faculty administrative duties.

The annual remuneration package for 2015, including benefits: R528 275.

To apply, please e-mail the below documents in a single pdf file to Ms Edith Graham at recruitment04 (at)

- UCT Application Form (download at

- Full Curriculum Vitae (CV)

- A clearly articulated statement describing their teaching experience and philosophy (applies to both positions), and a research statement (applies to standard academic position)

Please ensure the title and reference number are indicated in the subject line.

An application which does not comply with the above requirements will be regarded as incomplete.

You can also write to Dr Christine Swart at christine.swart (at) for more information on the department.

Telephone: +27 21 650 5405


Reference number: E15074

Closing date: 05 June 2015

15:17 [Pub][ePrint] Generic Conversions from CPA to CCA secure Functional Encryption, by Mridul Nandi and Tapas Pandit

  In 2004, Canetti-Halevi-Katz and later Boneh-Katz showed generic CCA-secure PKE constructions from a CPA-secure IBE. Goyal et al. in 2006 further extended the aforementioned idea implicitly to provide a specific CCA-secure KP-ABE with policies represented by monotone access trees. Later, Yamada et al. in 2011 generalized the CPA to CCA conversion to all those ABE, where the policies are represented by either monotone access trees (MAT) or monotone span programs (MSP), but not the others like sets of minimal sets. Moreover, the underlying CPA-secure constructions must satisfy one of the two features called {\\em key-delegation} and {\\em verifiability}. Along with ABE, many other different encryptions schemes, such as inner-product, hidden vector, spatial encryption schemes etc. can be studied under an unified framework, called {\\em functional encryption} (FE), as introduced by Boneh-Sahai-Waters in 2011. The generic conversions, due to Yamada et al., can not be applied to all these functional encryption schemes. On the other hand, to the best of our knowledge, there is no known CCA-secure construction beyond ABE over MSP and MAT. This paper provides different ways of obtaining CCA-secure functional encryptions of almost all categories. In particular, we provide {\\bf a generic conversion from a CPA-secure functional encryption into a CCA-secure functional encryption} provided the underlying CPA-secure encryption scheme has either restricted delegation or verifiability feature. We observe that almost all functional encryption schemes have this feature. The KP-FE schemes of Waters (proposed in 2012) and Attrapadung (proposed in 2014) for regular languages do not possess the usual delegation property. However, they can be converted into corresponding CCA-secure schemes as they satisfy the {\\em restricted delegation}.

15:17 [Pub][ePrint] A HYBRID APPROACH FOR THE SECURE TRANSMISSION OF H.264/AVC VIDEO STREAMS, by Sheena Sathyan and Shaji R S Professor

  In order to keep privacy and to maintain security of a data; it was necessary to keep the data in hidden manner or in a crypt format. The proposed work describes the encryption and data hiding techniques for an H.264/ AVC video in a cloud environment. And it clearly specifies how the integrity of the data should be relevant enough in an unsecured and constrained communication medium. The proposed scheme is based on the stream cipher, RC4 encryption; while encrypting a data, it is necessary to transfer the encryption keys in a secure manner for that the public key cryptosystem is proposed for the efficient key transferring. It also explains about the data embedding via compound mapping method in order secure the original video content, and then generating the hash value for the embedded data which may contain the encrypted video content, in order to check the integrity of the data. And at the receiver end, the processes; the verification of the hash value, the decryption and extraction of the video content may be done in an efficient manner. The results may clearly shows the size of the video is strictly preserved even after the encryption and the embedding techniques.

15:17 [Pub][ePrint] Improved Integral Cryptanalysis of Feistel Structures, by Bing Sun and Xin Hai and Lei Cheng and Zhichao Yang and Wenyu Zhang

  Feistel structure is among the most popular choices for designing ciphers. Recently, 3-round/5-round integral distinguishers for Feistel structures with non-bijective/bijective round functions are presented. At EUCRYPT 2015, Todo proposed the Division Property to effectively construct integral distinguishers for both Feistel and SPN structures. In this paper, firstly, it is proved that if a subset X of F_2^n has the division property D_k^n, the number of elements in X is at least 2^k, based on which we can conclude that if a multi-set X has the division property D_n^n, it is in some sense equivalent to either F_2^n or the empty set. Secondly, let d be the algebraic degree of the round function F of a Feistel structure. If d\\le n-1, the corresponding integral distinguishers are improved as follows: there exists a 3-round integral distinguisher with at most 2^n chosen plaintexts and a 4-round integral distinguisher with at most 2^{2n-2} chosen plaintexts. These results can give new insights to both the division property and Feistel structures.

15:17 [Pub][ePrint] Step by Step Towards Creating a Safe Smart Contract: Lessons and Insights from a Cryptocurrency Lab, by Kevin Delmolino, Mitchell Arnett, Ahmed Kosba, Andrew Miller, and Elaine Shi

  This paper describes a smart contract programming lab conducted in our undergraduate security class at the University of Maryland. Through our experiences, we have gained various insights on why it is difficult to create a safe smart contract. This lab also led to new insights for cybersecurity education.

15:17 [Pub][ePrint] Cryptanalysis of the multilinear map on the ideal lattices, by Jung Hee Cheon and Changmin Lee

  We improve the zeroizing attack on the multilinear map of Garg, Gentry and Halevi (GGH). Our algorithm can solve the Graded Decisional Diffie-Hellman (GDDH) problem on the GGH scheme when the dimension n of the ideal lattice Z[X]/(X^n+1) is O(kappa lambda^2) as suggested for the kappa-linear GGH scheme.

The zeroizing attack is to recover a basis of an ideal generated by a secret element g in Z[X]/(X^n+1) from the zero testing parameter and several encodings in public.

It can solve the DLIN and subgroup decision problems, but not the GDDH problem on the GGH scheme for the suggested dimension n due to the hardness of the smallest basis problem and the shortest vector problem on the ideal lattice. In this paper, we propose an algorithm to find a short vector in the ideal lattice (g) by applying a lattice reduction to a sublattice obtained from the Hermit Normal Form of (g). This attack utilizes that the determinant of the lattice (g) is not large.

We further show that if (g) has a large residual degree, one can find a short element of (g) in polynomial time of n.

In order to resist the proposed attacks, it is required that n= Omega tilde(kappa^2 lambda^3) and the positive generator of (g) intersection with Z is large enough.

11:44 [Job][New] Research Associate in Information Assurance, University of Luxembourg

  The Applied Security and Information Assurance Research Group – APSIA – has around 20 members and is headed by Professor Peter Y.A. Ryan. APSIA specialises in the mathematical foundations of information assurance: the mathematical modelling and analysis of information flows, the design and analysis of cryptographic primitives and protocols (both classical and quantum), secure verifiable voting systems, and anonymous marking systems and game-theoretic analysis of non-interference and coercion-resistance. The group has expertise in both the symbolic (formal methods) and the computational (“provable security”) styles of analysis and is investigating the links and synergies between them.

Role: to contribute to the research goals of the group, as outlined above. Expertise outside those listed above, but complementary will also be considered.

22:09 [Event][New] WEWoRC: 6th Western European Workshop on Research in Cryptology

  Submission: 3 June 2015
Notification: 17 June 2015
From October 1 to October 2
Location: Cottbus, Germany
More Information:

17:40 [Job][New] Post-Doc, Boston University, MIT, Northeastern, and UConn

  The Modular Approach to Cloud Security (MACS) is an NSF Frontier project that is building information systems with meaningful multi-layered security guarantees. It is a multi-institution research project with 13 PIs at four universities: Boston University, MIT, Northeastern, and the University of Connecticut.

The MACS team are looking for excellent postdoctoral fellows in the following areas:

  • Cryptography: theoretical and applied
  • Database security
  • Hardware security
  • High performance computing
  • Network security
  • Security modeling and analysis
  • Virtualization and operating system security

Preference will be given to candidates with expertise and interest in multiple areas. Fellows will work closely with multiple PIs on the MACS team and will be affiliated with all four host universities.

Candidates should send their CV, research statement, and list of references to macs-postdoc (at)

12:17 [Pub][ePrint] A comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device based on HIMMO, by Oscar Garcia-Morchon and Ronald Rietman and Sahil Sharma and Ludo Tolhui

  Smart objects are devices with computational and communication capabilities connected to the Internet forming the so called Internet of Things (IoT). The IoT enables many applications, for instance outdoor lighting control, smart energy and water management, or environmental sensing in a smart city environment. Security in such scenarios remains an open challenge due to the resource-constrained nature of devices and networks or the multiple ways in which opponents can attack the system during the lifecycle of a smart object.This paper firstly reviews security and operational goals in an IoT scenario inspired in a smart city environment. Then, we present a comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device. Our solution relies on the lightweight HIMMO scheme as the building stone and shows how HIMMO is not only efficient resource-wise, but that it enables advanced IoT protocols and deployments. Our design and analysis show that our HIMMO-based security architecture can be easily integrated in existing communication protocols such as IEEE 802.15.4 or OMA LWM2M providing a number of advantages that existing solutions cannot provide both performance and operation-wise.

12:17 [Pub][ePrint] Secure Deduplication of Encrypted Data without Additional Independent Servers, by Jian Liu and N. Asokan and Benny Pinkas

  Encrypting data at client-side before uploading it to a cloud storage service is essential for protecting users\' privacy. However client-side encryption is at odds with the standard practice of deduplication. Reconciling client-side encryption with cross-user deduplication has been an active research topic. We present the first secure cross-user deduplication scheme that supports client-side encryption {\\em without requiring any additional independent servers}. Interestingly, the scheme is based on using a PAKE (password

authenticated key exchange) protocol. We

%prove the security of our scheme in the malicious model and

demonstrate that {\\em our scheme provides better security guarantees than previous efforts}.

We examine both the effectiveness and the efficiency of our scheme, via simulations using realistic datasets and a proof-of-concept implementation.