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

05:50 [Event][New] Design and Security of Cryptographic Functions, Algorithms and Devices

  From July 30 to July 5
Location: Albena, Bulgaria
More Information:

05:50 [Event][New] CHES: Cryptographic Hardware and Embedded Systems

  Submission: 1 March 2013
Notification: 13 May 2013
From August 20 to August 23
Location: Santa Barbara, USA
More Information:

05:50 [Event][New] MoCrySEn '13: 2nd International Workshop on Modern Cryptography and Security Engineering

  Submission: 30 April 2013
Notification: 31 May 2013
From September 2 to September 6
Location: Regensburg, Germany
More Information:

05:50 [Event][New] ESORICS 2013: 18th European Symposium on Research in Computer Security

  Submission: 31 March 2013
Notification: 10 June 2013
From September 9 to September 11
Location: London, United Kingdom
More Information:

08:34 [Event][New] ISDFS '13: The First International Symposium on Digital Forensics and Security

  Submission: 15 April 2013
Notification: 25 April 2013
From May 20 to May 21
Location: Elaz??, Turkey
More Information:

08:33 [Event][New] Ice Break 2013: Ice Break 2013 - Summer School on Symmetric Cryptology

  From June 6 to June 12
Location: Reykjavik, Iceland
More Information:

08:32 [Event][New] SECITC '13: The 6th International Conference on Security for IT&C

  Submission: 29 April 2013
Notification: 28 May 2013
From June 25 to June 26
Location: Bucharest, Romania
More Information:

08:32 [Event][New] SAM'13: The 2013 International Conference on Security and Management

  Submission: 18 March 2013
Notification: 18 April 2013
From July 22 to July 25
Location: Las Vegas, USA
More Information:

13:17 [Pub][ePrint] On formal and automatic security verification of WSN transport protocols, by Ta Vinh Thong and Amit Dvir

  In this paper, we address the problem of formal and automated security verification of WSN transport

protocols that may perform cryptographic operations. The verification of this class of protocols is difficult

because they typically consist of complex behavioral characteristics, such as real-time, probabilistic, and

cryptographic operations. To solve this problem, we propose a

probabilistic timed calculus for cryptographic protocols, and demonstrate how to use this formal language

for proving security or vulnerability of protocols. The main advantage of the proposed language is that it

supports an expressive syntax and semantics, including bisimilarities that supports real-time, probabilistic,

and cryptographic issues at the same time. Hence, it can be used to verify the systems that involve these three

property in a more convenient way. In addition, we propose an automatic verification method, based on the

well-known PAT process analysis toolkit, for this class of protocols.

For demonstration purposes, we apply the proposed manual and automatic proof methods for verifying the security of

DTSN and SDTP, which are two of the recently proposed WSN tranport protocols.

13:17 [Pub][ePrint] Complete and Unified Group Laws are not Enough for Elliptic Curve Cryptography, by Graham Enos

  We analyze four recently proposed normal forms for elliptic curves. Though these forms are mathematically appealing and exhibit some cryptographically desirable properties, they nonetheless fall short of cryptographic viability, especially when compared to various types of Edwards Curves. In this paper, we present these forms and demonstrate why they fail to measure up to the standards set by Edwards Curves.

13:17 [Pub][ePrint] Revocable Identity-Based Encryption Revisited: Security Model and Construction, by Jae Hong Seo and Keita Emura

  In ACM CCS 2008, Boldyreva et al. proposed an elegant way of achieving an Identity-based Encryption (IBE) with {\\em efficient} revocation, which we call revocable IBE (RIBE). One of the significant benefit of their construction is scalability, where the overhead of the trusted authority is logarithmically increased in the number of users, whereas that in the Boneh-Franklin naive revocation way is linearly increased. All subsequent RIBE schemes follow the Boldyreva et al. security model and syntax. In this paper, we first revisit the Boldyreva et al. security model,

and aim at capturing the exact notion for the security of the naive but non-scalable Boneh-Franklin RIBE scheme. To this end, we consider a realistic threat, which we call {\\em decryption key exposure}. We also show that all prior RIBE constructions except for the Boneh-Franklin one are vulnerable to decryption key exposure. As the second contribution, we revisit approaches to achieve (efficient and adaptively secure) scalable RIBE schemes, and propose a simple RIBE scheme, which is the first scalable RIBE scheme with decryption key exposure resistance, and is more efficient than previous (adaptively secure) scalable RIBE schemes.

In particular, our construction has the shortest ciphertext size and the fastest decryption algorithm even compared with all scalable RIBE schemes without decryption key exposure resistance.