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

11:10 [Event][New] TCC: Theory of Cryptography Conference

  Submission: 3 September 2013
Notification: 5 November 2013
From February 24 to February 26
Location: La Jolla, CA, USA
More Information:

18:07 [News] Revisiting the IACR Publication Strategy: An Invitation for Comments


One of the key roles of the the IACR is the review and dissemination of scientific publications. In the past three years, there has been an intensive discussion of publication options, in which several alternatives have been reviewed thoroughly.

At the end of 2012, the IACR has signed a new publication contract with Springer for a 4-year period (2013-2017); IACR continues to publish the proceedings of our flagship conferences and workshops in Springer's Lecture Notes in Computer Science series. This new contract makes substantial progress towards broader access to our publications and reduces the cost of publications. However, the IACR Board believes that the area of scientific publications will undergo further changes in the next years, in particular towards open access. In addition, the expansion of our field (more than 1200 submissions and more than 250 publications per year) has resulted in a steadily increasing reviewing load. Some other scientific communities have updated their publication models with a shift towards journal publications.

The IACR Board understands that any change to our publication model has major implications on our members and on the cryptographic community at large. We also have learned that changing this model would be complex and time consuming: in order to be ready for a new publication model in 2018, a new strategy would need to be in place by mid 2015.

In view of this, the IACR Board has decided to start an open discussion on the future of IACR publications. In order to focus this discussion, Nigel Smart has drafted a radical proposal, that would involve moving towards a journal publication model. This proposal has been outlined at the rump session of Eurocrypt'13 and has been further refined based on comments received. The reason for working with a detailed document is that this seems the best way to make sure that all issues are identified and detailed solutions are proposed and compared.

It should be fully understood that this document is a strawman proposal: it does not reflect the view of the IACR Board; the document has also not been discussed with the steering committees of the workshops. Its only intention is to start an open discussion. In particular, the Board welcomes detailed comments and alternative proposals for the future of IACR publications.

We are looking forward to hearing from the community.

Bart Preneel
IACR-International Association for Cryptologic Research

15:17 [Forum] [IACR Publication Reform] Re: IACR publication reform - background material by nigel

  Please read the following letter from the President Before reading the straw man proposal Yours Nigel From: 2013-05-08 13:45:42 (UTC)

19:50 [Job][New] Senior / Scientists, A*STAR, Data Storage Institute, Singapore

  Highly motivated candidates interested in the area of Cryptography and Theory of Computation in general. Candidates are expected to have thorough undersnding of the state-of-the-art research in Cryptography, Security & Privacy and with the breadth of knowledge of the current issues and recent technology advancements.Research topics include but not necessary limited to New approaches of Computing on Encrypted Data in both theoretical and computational.


- Deep understanding of theory and implementation of Security protocols and applied cryptography

- Demonstrated expertise with computer architecture

- A strong programming background and experience with functional programming languages is preferred

- Experience in developing prototypes in a research environment

- A demonstrated potential to excel in collaborative research

- PhD in computer science or computer engineering

10:40 [Job][New] Computing Security Department Chair, Rochester Institute of Technology, Rochester, NY, USA

  The Department of Computing Security at the Rochester Institute of Technology invites applications for the position of Department Chair to begin August 2014.

In July of 2012, the Department of Computing Security at RIT was established to address critical security challenges that cut across computing disciplines. The department engages in a wide range of research and teaching activities, including: big data analytics, cryptology and covert communications, digital forensics, mobile devices, networks, privacy, security measurement, security pedagogy, sensors, software, and systems security. Through these activities, the department seeks to advance the discipline and to meet the rapidly growing need for computing security professionals.

The successful candidate will be ready to assume the leadership and administrative responsibilities of the department. A key role will be to lead the department in shaping and expanding its research and scholarship profile. Applicants are required to have a Ph.D. or equivalent in a related field and experience commensurate with that of a full professor. Applicants must have demonstrated research excellence in computing security, a track record of external funding, and a strong commitment to undergraduate and graduate education.

Candidates should visit and search 575BR for specific information about the position and the application process. Refer to for information about RIT and the B. Thomas Golisano College of Computing and Information Sciences.

RIT is an equal opportunity employer that promotes and values diversity, pluralism, and inclusion.  For more information or inquiries, please visit

06:17 [Pub][ePrint] Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions, by Martin R. Albrecht and Jean-Charles Faugère and Robert Fitzpatrick and Ludovic Perret

  In this paper, we investigate the security of a public-key encryption scheme introduced by Huang, Liu and Yang (HLY) at PKC\'12. This new scheme can be provably reduced to the hardness of solving a set of quadratic equations whose coefficients of highest degree are chosen according to a discrete Gaussian distributions. The other terms being chosen uniformly at random. Such a problem is a variant of the classical problem of solving a system of non-linear equations (PoSSo), which is known to be hard for random systems. The main hypothesis of Huang, Liu and Yang is that their variant is not easier than solving PoSSo for random instances. In this paper, we disprove this hypothesis. To this end, we exploit the fact that the new problem proposed by Huang, Liu and Yang reduces to an easy instance of the Learning With Errors (LWE) problem. The main contribution of this paper is to show that security and efficiency are essentially incompatible for the HLY proposal. That is, one cannot find parameters which yield a secure and a practical scheme. For instance, we estimate that a public-key of at least 1.03 GB is required to achieve 80-bit security against known attacks. As a proof of concept, we present practical attacks against all the parameters proposed Huang, Liu and Yang. We have been able to recover the private-key in roughly one day for the first challenge proposed by HLY and in roughly three days for the second challenge.

06:17 [Pub][ePrint] Obfuscating Conjunctions, by Zvika Brakerski and Guy N. Rothblum

  We show how to securely obfuscate the class of conjunction functions (functions like $f(x_1, \\ldots, x_n) = x_1 \\land \\lnot x_4 \\land \\lnot x_6 \\land \\cdots \\land x_{n-2}$). Given any function in the class, we produce an obfuscated program which preserves the input-output functionality of the given function, but reveals nothing else.

Our construction is based on multilinear maps, and can be instantiated using the recent candidates proposed by Garg, Gentry and Halevi (EUROCRYPT 2013) and by Coron, Lepoint and Tibouchi (CRYPTO 2013). We show that the construction is secure when the conjunction is drawn from a distribution, under mild assumptions on the distribution. Security follows from multilinear entropic variants of the Diffie-Hellman assumption. We conjecture that our construction is secure for any conjunction, regardless of the distribution from which it is drawn. We offer supporting evidence for this conjecture, proving that our obfuscator is secure for any conjunction against generic adversaries.

06:17 [Pub][ePrint] Partially blind password-based signatures using elliptic curves, by Kristian Gjøsteen

  Password-based signatures allow a user who can only remember a password to create digital signatures with the help of a server, without revealing the messages to be signed to the server.

Certain applications require the ability to disclose part of the message to the server. We define partially blind password-based signatures and construct a scheme based that we prove secure, based on a novel computational problem related to computing discrete logarithms.

Our scheme is based on Nyberg-Rueppel signatures. We give a variant of Nyberg-Rueppel signatures that we prove secure based on our novel computational problem.

Unlike previous password-based signature schemes, our scheme can be instantiated using elliptic curve arithmetic over small prime fields. This is important for many applications

06:17 [Pub][ePrint] The Norwegian Internet Voting Protocol, by Kristian Gjøsteen

  The Norwegian government ran a trial of internet remote voting during the 2011 local government elections, and will run another trial during the 2013 parliamentary elections. A new cryptographic voting protocol will be used, where so-called return codes allow voters to verify that their ballots will be counted as cast.

This paper discusses this cryptographic protocol, and in particular the ballot submission phase.

The security of the protocol relies on a novel hardness assumption similar to Decision Diffie-Hellman. While DDH is a claim that a random subgroup of a non-cyclic group is indistinguishable from the whole group, our assumption is related to the indistinguishability of certain special subgroups. We discuss this question in some detail.