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

2011-08-26
12:15 [Election] IACR Elections: Nominations possible until September 18

  The 2011 election is being held to fill three of nine IACR Director positions. The election is again run electronically and further information will be available on the IACR website. Nominations are now open. They are due by September 18. A nomination form is available at http://www.iacr.org/elections/2011/. Nominations are due by September 18. Election of Directors The three directors whose terms are expiring are Josh Benaloh, Stuart Haber, and Antoine Joux. The election committee Serge Vaudenay (Chair), Greg Rose, Martijn Stam



2011-08-24
18:44 [Job][New] 2 - 3 Research Fellow Positions, Nanyang Technological University, Singapore

  Coding and Cryptograph Research Group (http://www1.spms.ntu.edu.sg/~ccrg/index.html) at Nanyang Technological University, Singapore, is seeking candidates for 2-3 research fellow positions in the areas of lattice based cryptography, security multiparty computation and symmetric key cryptography. Interested applicants should send their CVs to ccrg_postdoc (at) ntu.edu.sg.

The positions are to be filled as soon as possible.



18:43 [Job][New] Assistant Professor, Stevens Institute of Technology, Hoboken, NJ, USA

  The Computer Science Department at Stevens Institute of Technology invites applications for a tenure-track position beginning in August 2012. Special consideration will be given to candidates in machine learning or secure systems at the assistant professor level. However, outstanding applicants at other levels and/or in other areas of Computer Science may also be considered. Applicants are expected to have a Ph.D. in Computer Science or a closely related field, a record that suggests the potential to achieve national prominence in research, and a strong commitment to teaching. A successful candidate will be expected to conduct a vigorous, externally funded research program and to teach and innovate curricula at both the undergraduate and graduate levels.

Stevens Institute of Technology is a private university located in Hoboken, New Jersey. The 55-acre campus is on the Hudson river across from midtown Manhattan within a few minutes from NYC via public transportation. Hoboken is an upscale small city, the residence of choice for many professionals working in NYC. Faculty live in Hoboken, Manhattan, and in suburban communities in Northern New Jersey along commuter train lines to Hoboken and NYC. Stevens\\\' location offers excellent opportunities for collaborations with nearby universities such as NYU, Princeton, Columbia, and Rutgers/DIMACS as well as major industrial research laboratories such as Bell Labs, AT&T Labs, IBM Research, Google New York, Siemens, and the Sarnoff Corporation. Stevens is an Affirmative Action/Equal Opportunity employer.

Review of applications will begin on September 15, 2011.

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

 



2011-08-23
17:24 [PhD][New] Chun-Yuan Hsiao: BUTTERFLY EFFECT IN CRYPTOGRAPHY: CONSEQUENCES OF CHANGES IN DEFINITIONS

  Chun-Yuan Hsiao
BUTTERFLY EFFECT IN CRYPTOGRAPHY: CONSEQUENCES OF CHANGES IN DEFINITIONS
foundations

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

 



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

 



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

 



2011-08-20
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
applications

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\n
\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[...]