International Association for Cryptologic Research

# IACR News Central

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-12
05:50 [Job][New]

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.

2011-08-10
17:27 [PhD][New]

Rafi Chen
New Techniques for Cryptanalysis of Cryptographic Hash Functions
foundations

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

2011-08-09
17:45 [PhD][Update]

Bart Mennink
Provable Security of Symmetric Primitives
secret-key cryptography

2011-08-08
18:09 [PhD][New]

Miroslav Knezevic
Efficient Hardware Implementations of Cryptographic Primitives
implementation

Society is undergoing a paradigm shift where the Information and Communication Technology (ICT) revolution goes along with the evolution of the humankind. The Internet is all around us and plays a crucial role in our ability to communicate. We often distribute our personal and other classified information using the benefits of the global network. Our demands to conceal confidential data are therefore being strongly manifested and become very important. By ensuring the objectives of information security, such as confidentiality, data integrity, entity authentication, non-repudiation, and many more, cryptography provides a natural solution to the issue of data protection.\r\n

\r\nThe ICT revolution has driven cryptography from the art of secret writing into a multidisciplinary scientific study of techniques for securing digital information. While providing aspects of information security, cryptography uses complex mathematical objects and often represents a bottleneck in hardware and software implementations. The research presented in this thesis deals with efficient hardware implementations of cryptographic primitives.\r\n

\r\nThe first part of the thesis is devoted to efficient[...]

18:09 [PhD][New]

Bart Mennink
Provable Security of Symmetric Primitives
secret-key cryptography

18:07 [PhD][New]

Yoni De Mulder
Design and Cryptanalysis of White-Box Implementations

18:07 [PhD][Update]

S. Dov Gordon
On Fairness in Secure Computation
cryptographic protocols

Secure computation is a fundamental problem in modern cryptography in which multiple parties join to compute a function of their private inputs without revealing anything beyond the output of the function. A series of very strong results in the 1980’s demonstrated that any polynomial-time function can be computed while guaranteeing essentially every desired security property. The only exception is the fairness property, which states that no player should receive their output from the computation unless all players receive their out- put. While it was shown that fairness can be achieved whenever a majority of players are honest, it was also shown that fairness is impossible to achieve in general when half or more of the players are dishonest. Indeed, it was proven that even boolean XOR cannot be com- puted fairly by two parties The fairness property is both natural and important, and as such it was one of the first questions addressed in modern cryptography (in the context of signature exchange). One contribution of this thesis is to survey the many approaches that have been used to guarantee different notions of partial fairness. We then revisit the topic of fairness within a mo[...]

11:21 [PhD][New]

Carmela Troncoso
Design and analysis methods for privacy technologies
applications

As advances in technology increase data processing and storage capabilities, the collection of massive amounts of electronic data raises new challenging privacy concerns. Hence, it is essential that system designers consider privacy requirements and have appropriate tools to analyze the privacy properties offered by new designs. Nevertheless, the privacy community has not yet developed a general methodology that allows engineers to embed privacy-preserving mechanisms in their designs, and test their efficacy. Instead, privacy-preserving solutions are designed and analyzed in an ad hoc manner, and hence it is difficult to compare and combine them in real-world solutions.\r\n \r\nIn this thesis we investigate whether general methodologies for the design and analysis of privacy-preserving systems can be developed. Our goal is to lay down the foundations for a privacy engineering discipline that provides system designers with tools to build robust privacy-preserving systems.\r\n \r\nWe first present a general method to quantify information leaks in any privacy-preserving design that can be modeled probabilistically. This method allows the designer to evaluate the degree of privacy prot[...]

11:21 [PhD][New]

Claudia Diaz
(no category)

11:20 [PhD][New]

Yevgeniy Vahlis
Black Box and White Box Cryptography
public-key cryptography