International Association for Cryptologic Research

IACR News Central

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

2012-03-26
11:18 [PhD][New] Arjen K. Lenstra

  Name: Arjen K. Lenstra




2012-03-25
21:07 [PhD][New] Abdoul Aziz Ciss: Arithmétique et Extracteurs déterministes sur les courbes elliptiques

  Name: Abdoul Aziz Ciss
Topic: Arithmétique et Extracteurs déterministes sur les courbes elliptiques
Category: public-key cryptography

Description: In this thesis, we present a new deterministic randomness extractor for a finite field $\\mathbb{F}_{p^n}$ and a deterministic randomness extractor for an elliptic curve $E$ defined over $\\mathbb{F}_{p^n}$. We also introduce a new generalization of the Huff elliptic curves. The extractors we present in this thesis can be used to derive a random secret key at the end of the Diffie-Hellman key exchange.\r\n\r\nWe have shown under the DDH assumption over $\\mathbb{F}_{2^n}$ that the $k$-first coefficients in $\\mathbb{F}_{2}$ of a random element of a subgroup of $\\mathbb{F}_{2^n}$ are undistinguishable from a random bit-string of the same length.\r\n\r\nWe also have shown under the DDH assumption over an elliptic curve $E$ defined over $\\mathbb{F}_{2^n}$ that the $k$-first coefficients in $\\mathbb{F}_{2}$ of a random point of the curve are indistinguishable from a random bit-string of the same length.\r\n\r\nWe also introduce successfully computation of the Tate pairing on the general Huff curves and we have shown that the Tate pairing on these curves are efficient as in the standard Huff curves.[...]


21:06 [PhD][New] Djiby Sow: Semi-modules

  Name: Djiby Sow
Topic: Semi-modules


21:06 [PhD][New] Université Cheikh Anta Diop de Dakar-Sénégal

  Name: Université Cheikh Anta Diop de Dakar-Sénégal




2012-03-23
14:11 [Event][New] CrossFyre 2012: Workshop on Cryptography, Robustness, and Provably Secure Schemes for Femal

  Submission: 30 April 2012
Notification: 15 May 2012
From June 14 to June 15
Location: Eindhoven, The Netherlands
More Information: http://www.crossfyre.cased.de/home.html


06:41 [Event][New] CBC 2012: Code-based Cryptography Workshop 2012

  From May 9 to May 11
Location: Lyngby, Denmark
More Information: http://cbc2012.mat.dtu.dk/


06:40 [Event][New] DIAC: Directions in Authenticated Ciphers

  Submission: 7 May 2012
Notification: 4 June 2012
From July 5 to July 6
Location: TBD, most likely Stockholm, most likely Sweden
More Information: http://www.hyperelliptic.org/DIAC/


06:40 [Event][New] IWDW'12: 11th International Workshop on Digital Forensics and Watermarking

  Submission: 1 July 2012
Notification: 14 August 2012
From October 31 to November 3
Location: Shanghai, China
More Information: http://infosec.sjtu.edu.cn:8081/IWDW/




2012-03-22
21:26 [Job][New] Post-Doc, Aalto University, Department of Information and Computer Science, Espoo, Finland

  New extensions of linear and differential cryptanalysis methods for symmetric key ciphers will be investigated with special attention to distribution based distinguishers. The general goal would be to develop new and more accurate design criteria for symmetric key ciphers and their key scheduling algorithms. The specific research goals will be adjusted according to the interests of the Post-Doc.

The start of the position is negotiable. Also late applications can be taken into consideration.





2012-03-20
21:49 [Job][New] Postdoc in Game Theoretic Privacy-Preservation applied to Data Mining, Loughborough University, UK

  Funded by the UK EPSRC and Ministry of Defence (MOD) Defence Science & Technology Laboratory (DSTL), this project focuses on the problem setting where coalition parties, each owning a large set of data, desire to discover new knowledge when they collaborate to jointly process all the datasets; while ensuring that each individual dataset is not revealed to the other parties. This is expected to involve homomorphic encryption and multi-party computation.

Applicants with a PhD in cryptography, privacy preservation, game theory, data mining or optimization are encouraged to apply.



21:48 [PhD][Update] Phan Duong Hieu: Sécurité et efficacité de schémas cryptographiques

  Name: Phan Duong Hieu
Topic: Sécurité et efficacité de schémas cryptographiques
Category:public-key cryptography

Description: Provable security is nowadays one of the major lines of research in Cryptography. It aims at providing security proofs of cryptographic schemes in a complexity–theoretical sense: if one can break the scheme, one can solve the underlying problem. Provable security is strongly related to three main trends in the development of Cryptology: formalization of security notions, design of cryptographic systems, and development of new cryptographic features.
In this thesis, we first deal with notions of security in both asymmetric and symmetric encryption. We study more in detail the relation between different attack models in asymmetric encryption. We also establish the relation between the notion of (super) pseudo–random permutation and that of semantic security in symmetric encryption.
Secondly, we propose new efficient constructions for asymmetric encryption in the random oracle model (new paddings for encryption, and universal paddings for both encryption and signature). Furthermore, we introduce a new class of public–key encryption schemes: chosen ciphertext secure schemes without redundancy. Up to now, redundancy used to be required for proofs of security in public–key encryption schemes.
Finally, we consider the traitor tracing problem in broadcast encryption and we introduce a new feature: public traceability. We construct a basic scheme with such feature, and then generalize it to achieve almost optimal transmission rates.[...]