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

21:17 [Pub][ePrint] ID Based Signcryption Scheme in Standard Model, by S. Sharmila Deva Selvi and S. Sree Vivek and Dhinakaran Vinayagamurthy and C. Pandu Rangan

  Designing an ID based signcryption scheme in the standard model is among the most interesting and important problems in cryptography. However, all the existing systems in the ID based setting, in the standard model, do not have either the unforgeability property or the indistinguishability property or both of them. In this paper, we present the first provably secure ID based signcryption scheme in the standard model with both these properties. The unforgeability property of this scheme is based on the hardness of Computational Diffie-Hellman problem and the indistinguishability property of this scheme is based on the hardness of Decisional Bilinear Diffie-Hellman problem. Our scheme is strongly unforgeable in the strong attack mode called insider security. Moreover, our scheme possess an interesting property called public verifiability of the ciphertext. Our scheme integrates cleverly, a modified version of Waters\' IBE and a suitably modified version of the ID based signature scheme in the standard model proposed by Paterson et al. However, our security reductions are more efficient. Specifically, while the security reductions for indistinguishability is similar to the bounds of Waters\' scheme, the unforgeability reductions are way better than the bounds for Paterson et al.\'s scheme.

06:17 [Pub][ePrint] Analysis and Construction of Efficient RFID Authentication Protocol with Backward Privacy, by Shaohui Wang,Sujuan Liu,Danwei Chen

  Privacy of RFID systems is receiving increasing attentions in the

RFID community and an important issue required as to the security of RFID system. Backward privacy means the adversary can not trace the tag later even if he reveals the internal states of the tag sometimes before. In this paper, we analyze two recently proposed RFID authentication schemes: Randomized GPS and Randomized Hashed GPS scheme. We show both of them can not provide backward privacy in Juels and Weis privacy model, which allows the adversary to know whether the reader authenticates the tag successfully or not. In addition, we present a new protocol, called Challenge-Hiding GPS, based on the Schnorr identification scheme. The challenge is hidden from the eavesdropping through the technique of Diffie-Hellman key agreement protocol. The new protocol can satisfy backward privacy, and it has less communication overheads and almost the same computation, compared with the two schemes analyzed.

18:17 [Event][New] ICDIPC: 3rd Inter. Conf. on Digital Information Processing & Communications

  Submission: 15 December 2012
Notification: 1 January 2013
From January 30 to February 1
Location: Dubai, United Arab Emirates
More Information:

08:35 [Event][New] Inscrypt 2012: The 8th China International Conference on Information Security and Cryptology

  Submission: 20 August 2012
Notification: 20 August 2012
From November 28 to December 1
Location: Beijing, China
More Information:

08:35 [Event][New] Inscrypt'2012: The 8th China International Conference on Information Security and Cryptology

  Submission: 20 August 2012
Notification: 20 August 2012
From November 28 to December 1
Location: Beijing, China
More Information:

18:39 [Event][New] WESS 2012: 7th Workshop on Embedded Systems Security

  Submission: 27 July 2012
Notification: 24 August 2012
From October 12 to October 12
Location: Tampere, Finland
More Information:

15:20 [Conf][Crypto] CRYPTO 2012 - CALL FOR PARTICIPATION

  CALL FOR PARTICIPATION **********************************************************
CRYPTO 2012 - The 32nd International Cryptology Conference
Santa Barbara, CA, USA. August 19 - 23, 2012 **********************************************************


CRYPTO 2012 is the 32nd International Cryptology Conference. It is sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the Computer Science Department of UCSB. The conference started in 1981 and has attracted a wide international audience from both the academic and industrial communities. The conference program covers a broad spectrum of topics in cryptology, and it is organized as a 4-day event featuring:
-- two invited talks
-- one tutorial
-- 48 technical presentations


-- "The End of Crypto", by Jonathan Zittrain, Harvard University
-- "Recent Advances and Existing Research Questions in Platform Security", by Ernie Brickell, Intel Corporation

-- "Pinning Down 'Privacy' in Statistical Databases", by Adam Smith, Pennsylvania State University



With funding support from the NSF and our industry sponsors, we are now able to award a second round of stipends to student attendees, both domestic and international. Application deadline: July 27th, 2012.

Google, Microsoft Research, Qualcomm, RIM, Voltage Security

03:17 [Pub][ePrint] CCBKE - Session Key Negotiation for Fast and Secure Scheduling of Scientific Applications in Cloud Computing, by Chang Liu and Xuyun Zhang and Chi Yang and Jinjun Chen

  Instead of purchasing and maintaining their own computing infrastructure, scientists can now run data-intensive scientific applications in a hybrid environment such as cloud computing by facilitating its vast storage and computation capabilities. During the scheduling of such scientific applications for execution, various computation data flows will happen between the controller and computing server instances. Amongst various quality-of-service (QoS) metrics, data security is always one of the greatest concerns to scientists because their data may be intercepted or stolen by malicious parties during those data flows, especially for less secure hybrid cloud systems. An existing typical method for addressing this issue is to apply Internet Key Exchange (IKE) scheme to generate and exchange session keys, and then to apply these keys for performing symmetric-key encryption which will encrypt those data flows. However, the IKE scheme suffers from low efficiency due to its low performance of asymmetric-key cryptological operations over a large amount of data and high-density operations which are exactly the characteristics of scientific applications. In this paper, we propose Cloud Computing Background Key Exchange (CCBKE), a novel authenticated key exchange scheme that aims at efficient security-aware scheduling of scientific applications. Our scheme is designed based on randomness-reuse strategy and Internet Key Exchange (IKE) scheme. Theoretical analyses and experimental results demonstrate that, compared with the IKE scheme, our CCBKE scheme can significantly improve the efficiency by dramatically reducing time consumption and computation load without sacrificing the level of security.

03:17 [Pub][ePrint] Cryptanalysis of Sood et al.\'s Authentication Scheme using Smart Cards, by Rafael Martínez-Peláez and Francisco Rico-Novella

  In 2010, Sood-Sarje-Singh proposed a dynamic ID-based remote user authentication scheme and claimed that their scheme is more secure than Das et al.\'s scheme and Liao et al.\'s scheme. However, we show that Sood et al.\'s scheme is still vulnerable to malicious user attack, man-in-the-middle attack, stolen smart card attack, off-line ID guessing attack, impersonation attack, and server spoofing attack, making the scheme unfeasible for practical implementation.

03:17 [Pub][ePrint] New cryptographic constructions using generalized learning with errors problem, by Jintai ding

  We present a generalized learning with errors (LWE) problem, which is essentially a simple and direct extension of the original LWE problem to the case of matrices.

Then we use this new version of LWE problem, which we call matrix LWE problem to build new cryptographic schemes, which include a new scalable key distribution scheme, a new key exchanges scheme and a new simple identity-based encryption scheme.

03:17 [Pub][ePrint] The Arithmetic Codex, by Ignacio Cascudo and Ronald Cramer and Chaoping Xing

  We introduce the notion of {\\em arithmetic codex}, or {\\em codex} for short.

It encompasses several well-established notions from cryptography (arithmetic secret sharing schemes, i.e., enjoying additive as well as multiplicative properties) and algebraic complexity theory (bilinear complexity of multiplication) in a natural mathematical framework.

Arithmetic secret sharing schemes have important applications to secure multiparty computation and even to {\\em two}-party cryptography. Interestingly, several recent applications to two-party cryptography rely crucially on the existing results on ``{\\em asymptotically good} families\'\' of suitable such schemes. Moreover, the construction of these schemes requires asymptotically good towers of function fields over finite fields: no elementary (probabilistic) constructions are known in these cases. Besides introducing the notion, we discuss some of the constructions, as well as some limitations.