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

08:19 [Event][New] ICITS 2012: Sixth International Conference on Information-Theoretic Security



  Chun-Yuan Hsiao

Modern cryptography places a great deal of emphasis on de nitions, because a precise\r\nde nition formalizes our intuition about a cryptographic primitive.\r\n\r\nThis dissertation consists of two parts. The first part demonstrates the importance of\r\nde nitional precision by examining a previously overlooked subtlety in de ning a widelyused\r\nprimitive: the Collision Resistant Hash Function, or CRHF. The subtlety lies in the\r\nmethod by which the CRHF key is generated: namely, whether a trusted party needs to\r\nperform key generation (the \"secret-coin\" variant), or whether any public random string\r\ncan be used as the key (the \"public-coin\" variant). Adding a new technique to the so-called \"black-box separation\" methodology, this thesis shows that these two variants of CRHF, which were sometimes used interchangeably, are actually distinct in general. However, they are also equivalent under certain conditions; the thesis identi es a precise and broad set of such conditions.\r\n\r\nThe second part of this dissertation investigates two known de nitions of entropy. Shannon has shown the equivalence of these two de nitions by proving that the shortest compression length of [...]

16:46 [Event][New] COSADE '12: 3rd Int. Workshop on Constructive Side-Channel Analysis and Secure Design


08:26 [Event][New] Inscrypt'2011: The 7th China International Conference on Information Security & Cryptolyo


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: