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

18:54 [Event][New] ISPEC 2012: The 8th Int. Conference on Information Security Practice and Experience


10:16 [PhD][New] Pradeep Kumar Mishra: Studies on Efficient and Secure Implementation of Elliptic and Hyperelliptic Curve Cryptosystems

  Pradeep Kumar Mishra
Studies on Efficient and Secure Implementation of Elliptic and Hyperelliptic Curve Cryptosystems
public-key cryptography

10:16 [PhD][New] Palash Sarkar

  Palash Sarkar

10:16 [PhD][New] Ero Balsa: Privacy in online social networks: analysis and solutions

  Ero Balsa
Privacy in online social networks: analysis and solutions

Online social networks have revolutionized the way people communicate, meet, share information, and socialize both in their private and professional lives. Although these developments have brought unquestionable benefits to society, users are increasingly worried about the lack of control over their private information. The ease with which information is propagated over the Internet has led to a new reality where the acquisition of personal data is easier than never before. Solutions that provide users with the ability to benefit from social networking technologies while offering well-understood privacy properties have not yet been developed.\r\n


\r\nTo better understand privacy risks in social networks I will develop methodologies to systematically analyze these risks by capturing information leakages in the various components of the system, including content as well as traffic data. This will involve defining models for user behavior, adversarial knowledge and capabilities, as well as metrics to quantify the degree to which privacy requirements are satisfied. Based on the understanding of how privacy breaches are enabled by information flows in social networ[...]

17:23 [PhD][New] Scott Russell: Communication and Query Privacy: Intrusion-Resilient Secure Channels and Private Database Queries

  Scott Russell
Communication and Query Privacy: Intrusion-Resilient Secure Channels and Private Database Queries
cryptographic protocols

One part of this dissertation describes a new two-party communication primitive we call an Intrusion-Resilient Secure Channel (IRC) that offers improved confidentiality over traditional secure channels against passive but mobile, highly adaptive adversaries. IRCs limit the loss of confidentiality resulting from the exposure of parties’ secret keys by utilizing key-evolution and proactive security techniques similar to those employed in intrusion-resilient signature schemes. We show how to construct an IRC using existing chosen-ciphertext-secure public-key cryptosystems in a black-box manner. We also discuss how to use IRCs to improve two-party protocol security; as a concrete example, we prove an IRC-augmented version of the Itkis-Reyzin intrusion-resilient signature scheme secure against highly adaptive adversaries capable of exposing even expired secrets.\r\n\r\n

The second part describes an interactive binary search protocol with user and server privacy provided that improves upon an existing user-private only protocol. We utilize our search protocol to construct user- and server-private protocols for predecessor, successor, and simple range queries on one-dimensional dat[...]

17:23 [PhD][New] Anthony Van Herrewege: Security components for trusted computer systems

  Anthony Van Herrewege
Security components for trusted computer systems

Efficient designs and implementations for embedded security.[...]

00:06 [Event][Update] TCC 2012: Ninth Theory of Cryptography Conference

  Submissiondate:15 September 2011
Notificationdate:1 December 2011
From March 18 to March 21
Location: Taormina, Italy
More Information:

05:51 [Job][New] Postdoctoral Researcher, University of Maryland

  I will have a postdoc position available in my group starting Sept. 1. This will be a 1-year position, with the possibility of extending it to a second year. Shorter-term visits, or start dates after Sept. 1, can also be considered.

The position is fairly open. In particular, I would encourage applicants who work on more applied aspects of computer/network security in addition to those who work on cryptography. Students in the areas of information theory, game theory, or complexity-theoretic aspects of cryptography will also be considered.

If you are interested, please send me an email with a copy of your CV, a short research statement, and the name of at least one reference.

05:50 [Job][New] Lecturer, Queensland University of Technology, Brisbane, Australia


The Queensland University of Technology (QUT) in Brisbane, Australia, invites applications for full-time Lecturer positions starting in 2012. Areas of interest include cryptography, information security, network security, and digital forensics.

Appointee(s) will undertake their research in QUT\'s Information Security Institute, a multi-disciplinary institute bringing together information security researchers from computer science, mathematics, engineering, business, and law, with a leading national profile and strong international links.

Applicants should have completed (or be under examination for) a PhD in computer science, mathematics, or a related area and be early career researchers (less than three years in an academic role). Appointee(s) will develop and maintain an active research program, teach at undergraduate and graduate levels, supervise research students, and participate in QUT\'s Early Career Academic Development program.

17:27 [PhD][New] Rafi Chen: New Techniques for Cryptanalysis of Cryptographic Hash Functions

  Rafi Chen
New Techniques for Cryptanalysis of Cryptographic Hash Functions

A cryptographic hash function H takes a message M of an arbitrary length and produces an easy-to-compute message digest H(M) which has fixed, relatively short size. H(M) has to be collision free, i.e., it should be difficult to find any two messages that have the same message digest. Two other important properties are: Preimage resistance, i.e., given a message digest s it should be difficult to find M such that H(M)=s, and second-preimage resistance, i.e., given M1 it should be difficult to find M2 such that H(M1)=H(M2).\r\n
\r\nA widely known technique to attack the collision freeness property is differential cryptanalysis. In this technique a difference between two messages is chosen and the evolution of differences from the plaintext through the intermediate data into the ciphertext is predicted. The differences and the probabilities of the predictions are called a characteristic. An attacker that uses the technique aims at finding a characteristic with high probability, and at constructing an efficient algorithm that selects messages that follow the differences of the characteristic. Our contributions are at both aims.\r\n
\r\nThe multi-block technique is based on our ob[...]

17:45 [PhD][Update] : Provable Security of Symmetric Primitives

  Bart Mennink
Provable Security of Symmetric Primitives
secret-key cryptography