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

04:17 [Pub][ePrint] Short Signatures from Diffie-Hellman, Revisited: Sublinear Public Key, CMA Security, and Tighter Reduction, by Jae Hong Seo

  Designing practical signature scheme based on the standard assumption such as the Computational Diffie-Hellman (CDH) assumption is important both from a practical and a theoretical point of view. Currently, there are only three standard model CDH-based signature schemes with short signatures due to Waters (EUROCRYPT 2005), Seo, and B\\\"ohl et al. (the merged paper in EUROCRYPT 2013). The Waters signature scheme achieves the Existentail UnForgeability against Chosen Message Attack (EUF-CMA) with nearly optimal reduction. However, this scheme suffers from large public keys. To shorten public key size, Seo and B\\\"ohl et al. proposed new approaches, respectively, but each approach has a weak point rather than the Waters signature scheme; Seo\'s approach could prove only a rather weak security, called the bounded CMA security, and B\\\"ohl et al.\'s approach inherently accompanies a loose reduction.

In this paper, we aim at stepping towards practical EUF-CMA secure signatures with tighter reduction; that is, we achieve sublinear public keys with preserving the same security as the Waters signatures. To this end, we revisit the Seo signature scheme and devise an alternative and simple analysis leading the standard EUF-CMA security with tighter reduction. In particular, our security proof has a reduction loss of $O(\\lambda q)$, which is less than $O(\\sqrt{\\frac{\\lambda}{\\log}}\\lambda q)$ of the original security proof, where $\\lambda$ is the security parameter, and is almost the same as that of the Water signature scheme.

01:17 [Pub][ePrint] Automated Proof for Authorization Protocols of TPM 2.0 in Computational Model (full version), by Weijin Wang, Yu Qin, Dengguo Feng

  We present the first automated proof of the authorization protocols in TPM 2.0 in the computational model. The Trusted Platform Module(TPM) is a chip that enables trust in computing platforms and achieves more security than software alone. The TPM interacts with a caller via a predefined set of commands. Many commands reference TPM-resident structures, and use of them may require authorization. The TPM will provide an acknowledgement once receiving an authorization. This interact ensure the authentication of TPM and the caller. In this paper, we present a computationally sound mechanized proof for authorization protocols in the TPM 2.0. We model the authorization protocols using a probabilistic polynomial-time calculus and prove authentication between the TPM and the caller with the aid of the tool CryptoVerif, which works in the computational model. In addiction, the prover gives the upper bounds to break the authentication between them.

19:17 [Pub][ePrint] Breaking `128-bit Secure\' Supersingular Binary Curves (or how to solve discrete logarithms in $\\F_{2^{4 \\cdot 1223}}$ and $\\F_{2^{12 \\cdot 367}}$), by Robert Granger and Thorsten Kleinjung and Je

  In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thom\\\'e. Using these developments, Adj, Menezes, Oliveira and Rodr\\\'iguez-Henr\\\'iquez analysed the concrete security of the DLP, as it arises from pairings on (the Jacobians of) various genus one and two supersingular curves in the literature. At the $128$-bit security level, they suggested that the new algorithms have no impact on the security of a genus one curve over $\\F_{2^{1223}}$, and reduce the security of a genus two curve over $\\F_{2^{367}}$ to $94.6$ bits. In this paper we propose a new field representation and efficient descent principles, which together demonstrate that the new techniques can be made practical at the 128-bit security level. In particular, we show that the aforementioned genus one curve offers only $59$ bits of security, and we report a total break of the genus two curve. Since these techniques are widely applicable, we conclude that small characteristic pairings should henceforth be considered completely insecure.

12:30 [Job][New] cryptologic product development team members and leads, TECHNA, Kolkata India

  TECHNA, an American company is collaborating with ISI faculty to create a range of cybersecurity products using cryptology/cryptography

12:27 [Event][New] ACM TECS: ACM TECS: Embedded Platforms for Cryptography in the Coming Decade

  Submission: 1 July 2014
Notification: 1 October 2014
From July 1 to July 1
More Information:

15:48 [Job][New] Lecturer/Associate Professor/Researcher in Cryptology and Security, Hangzhou Normal University, China, Pacific Area

  The group for Cryptography and Network Security at Hangzhou Normal University, China chaired by Prof. Dr. Qi Xie is looking for two faculty members with strong crypto/security background. Candidates should have a PhD degree in mathematics, computer science, or related disciplines, be highly motivated with strong R&D capability and also a good team player, have good presentation and communication skills, be able to perform deep system-level investigations of security mechanisms. The candidates are expected to publish high-quality papers OR develop security-related projects. Any prior experience in e-health or WSN/VANETs security is certainly an asset..

Interested candidates please send CV to Shengbao Wang {shengbaowang (at)}. The positions offer a competitive salary. All candidates will be contacted for further infomation.

06:27 [Event][New] NSS 2014: The 8th International Conference on Network and System Security

  Submission: 8 April 2014
Notification: 10 June 2014
From October 15 to October 17
Location: Xi'an, China
More Information:

22:17 [Pub][ePrint] Quantum position verification in the random oracle model, by Dominique Unruh

  We present a quantum position verification scheme in the random oracle model. In contrast to prior work, our scheme does not require bounded storage/retrieval/entanglement assumptions. We also give an efficient position-based authentication protocol. This enables secret and authenticated communication with an entity that is only identified by its position in space.

16:17 [Pub][ePrint] Halka: A Lightweight, Software Friendly Block Cipher Using Ultra-lightweight 8-bit S-box, by Sourav Das

  This paper presents the design of a lightweight, yet software friendly, block cipher. Most of the lightweight block ciphers are nibble-oriented as the implementation of a 4-bit S-box is much more compact than an 8-bit S-box. This paper uses a novel implementation of multiplicative inverse for 8-bit S-boxes using LFSR requiring only 138 gate-equivalent. With this powerful scheme, we design a lightweight block cipher competitive with existing standards in terms of hardware gate equivalent first time using an 8-bit S-box.

16:17 [Pub][ePrint] A Note on the CLRW2 Tweakable Block Cipher Construction, by Gordon Procter

  In this note, we describe an error in the proof for CLRW2 given by Landecker et al. in their paper at CRYPTO 2012 on the beyond-birthday-bound security for tweakable block ciphers.

We are able to resolve the issue, give a new bound for the security of CLRW2, and identify a potential limitation of this proof technique when looking to extend the scheme to provide asymptotic security.

16:17 [Pub][ePrint] Polynomial Time Attack on Wild McEliece Over Quadratic Extensions, by Alain Couvreur and Ayoub Otmani and Jean-Pierre Tillich

  We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such codes can be distinguished from random codes to compute some filtration, that is to say a family of nested subcodes which will reveal their secret algebraic description.