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

2013-01-11
22:17 [Pub][ePrint] Cryptanalysis of a pairing-free identity-based authenticated group key agreement protocol for imbalanced mobile networks, by Qingfeng Cheng

  Recently, Isalam and Biswas proposed a new group key agreement (GKA) protocol for imbalanced mobile networks. In this letter, we will show that Isalam et al.\'s GKA protocol is not secure.



22:17 [Pub][ePrint] A Matrix Approach for Constructing Quadratic APN Functions, by Yuyin Yu and Mingsheng Wang and Yongqiang Li

  We find a one to one correspondence between quadratic APN functions without linear and constant terms and a special kind of matrices (We call such matrices as QAMs). Based on the nice mathematical structures of the QAMs, we have developed efficient algorithms to construct quadratic APN functions. On $\\mathbb{F}_{2^7}$, we have found more than 470 classes of new CCZ-inequivalent quadratic APN functions, which is 20 times more than the known ones. Before this paper, there are only 23 classes of CCZ-inequivalent APN functions on $\\mathbb{F}_{2^{8}}$ have been found. With our method, we have found more than 1000 classes of new CCZ-inequivalent quadratic APN functions, and this number is still arising quickly.





2013-01-07
13:55 [Event][New] Asiacrypt: Asiacrypt 2013

  Submission: 20 May 2013
Notification: 15 August 2013
From December 1 to December 5
Location: Bangalore, India
More Information: http://www.iacr.org/conferences/asiacrypt2013/


13:54 [Event][New] Asiacrypt: Asiacrypt

  Submission: 20 May 2013
Notification: 15 August 2013
From December 1 to December 5
Location: Bangalore, India
More Information: http://www.iacr.org/conferences/asiacrypt2013/


13:23 [PhD][Update] Dries Schellekens: Design and Analysis of Trusted Computing Platforms

  Name: Dries Schellekens
Topic: Design and Analysis of Trusted Computing Platforms
Category:applications

Description:

This thesis deals with the analysis and design of trusted computing platforms. Trusted computing technology is a relatively new enabling technology to improve the trustworthiness of computing platforms. With minor changes to the boot process and the addition of a new hardware security component, called TPM (Trusted Platform Module), trusted computing platforms offer the possibility to verifiably report their integrity to external parties (i.e., remote attestation) and to bind information to a specific platform (i.e., sealed storage).

The first part of this thesis mainly focuses on the analysis of existing trusted computing platforms. We analyze the functionality provided by the specifications of the TCG (Trusted Computing Group) and purely software-based alternatives. Based on this analysis we present an improvement to a software-based attestation scheme: we propose to measure the execution time of a memory checksum function locally (with the time stamping functionality of the TPM) instead of remotely (over the network).

We also study the resilience of trusted computing platforms against hardware attacks. We describe how attacks on the communication interface of the TPM can circumvent the measured boot process. The feasibility of these attacks is investigated in practice. Additionally we explore which operations should be targeted with a side channel attack to extracts the secret keys of a TPM.

The second part of this thesis addresses some of the challenges to implement trusted computing technology on embedded and recon?gurable devices. One of the main problems when integrating a TPM into a system-on-chip design, is the lack of on-chip reprogrammable non volatile memory. We develop schemes to securely externalize the non-volatile storage of a TPM. One scheme relies a new security primitive, called a reconfigurable physical unclonable function, and another extends the security perimeter of the TPM to the external memory with a cryptographic prot[...]


13:13 [PhD][New] Dries Schellekens: Design and Analysis of Trusted Computing Platforms

  Name: Dries Schellekens
Topic: Design and Analysis of Trusted Computing Platforms
Category: applications

Description: This thesis deals with the analysis and design of trusted computing platforms. Trusted computing technology is a relatively new enabling technology to improve the trustworthiness of computing platforms. With minor changes to the boot process and the addition of a new hardware security component, called TPM (Trusted Platform Module), trusted computing platforms o?er the possibility\r\nto veri?ably report their integrity to external parties (i.e., remote attestation) and to bind information to a speci?c platform (i.e., sealed storage).\r\n\r\nThe ?rst part of this thesis mainly focuses on the analysis of existing trusted computing platforms. We analyze the functionality provided by the speci?cations of the TCG (Trusted Computing Group) and purely software-based alternatives. Based on this analysis we present an improvement to a software-based attestation scheme: we propose to measure the execution time of a memory checksum function locally (with the time stamping functionality of the TPM) instead of remotely (over the network). \r\n\r\nWe also study the resilience of trusted computing platforms against hardware attacks. We describe how attacks on the communication interface of the TPM can circumvent the measured boot process. The feasibility of these attacks is investigated in practice. Additionally we explore which operations should be targeted with a side channel attack to extracts the secret keys of a TPM.\r\n\r\nThe second part of this thesis addresses some of the challenges to implement trusted computing technology on embedded and recon?gurable devices. One of the main problems when integrating a TPM into a system-on-chip design, is the lack of on-chip reprogrammable non volatile memory. We develop schemes to securely externalize the non-volatile storage of a TPM. One scheme relies a new security primitive, called a recon?gurable physical unclonable function, and another extends the security perimeter of the TPM to the external memory with a cryptographic protoco[...]


10:47 [PhD][New] Junko Takahashi: Security Evaluation of Side-Channel Resistance for Symmetric Ciphers Using Experimental and Theoretical Approaches

  Name: Junko Takahashi
Topic: Security Evaluation of Side-Channel Resistance for Symmetric Ciphers Using Experimental and Theoretical Approaches
Category: implementation



06:25 [Job][New] Research + Teaching Assistant / Ph.D. student, University of Applied Sciences Offenburg, Germany

  The Department of Media and Information Technology is looking for a research and research assistant in the field of applied cryptography. The possibility to earn a PhD degree in cooperation with the University of Mannheim is given.

Job description:

  • Active and self-reliant participation in research projects in the area of applied cryptography, e.g. on topics in light-weight cryptography or in analysis of cryptographic protocols and interfaces.

  • Assisting in computer science teaching (in particular tutoring).

  • Administration of the IT security lab (computer pool).

Requirements

  • Master degree or equivalent in mathematics, computer science, or similar.

  • Very good skills in mathematics (in particular algebra and combinatorics) and computer science (in particular programming and algorithmics).

  • First experience in cryptography and IT security.

  • Basic knowledge in system administration (Linux, Windows).

  • Fluent English (both spoken and written).

The position is initially for two years, with possibility for extension upon successful progress in the PhD studies.



06:15 [PhD][New] Yang Li: New Fault-Based Physical Attacks and Their Countermeasures

  Name: Yang Li
Topic: New Fault-Based Physical Attacks and Their Countermeasures
Category: implementation



06:15 [PhD][New] Edoardo Persichetti: Improving the Efficiency of Code-Based Cryptography

  Name: Edoardo Persichetti
Topic: Improving the Efficiency of Code-Based Cryptography
Category: public-key cryptography

Description:

Recent public-key cryptography is largely based on number theory problems, such as factoring or computing of discrete logarithm. These systems constitute an excellent choice in many applications, and their security is well defined and understood. One of the major drawbacks, though, is that they will be vulnerable once quantum computers of an appropriate size are available. There is then a strong need for alternative systems that would resist attackers equipped with quantum technology.

\r\n\r\n

One of the most well-known systems of this kind is the McEliece cryptosystem, introduced in 1978, that is based on algebraic coding theory. There are no known vulnerabilities against quantum computers, and it has a very fast and efficient encryption procedure. However, it has also one big flaw, the size of the public key, that makes it impractical for many applications.

\r\n\r\n

The first part of this thesis is dedicated to finding a way to significantly reduce the size of the public key.\r\nLatest publications achieve very good results by using codes with particular structures, obtaining keys as small as 4,096 bits. Unfortunately, almost all of the variants presented until now have been broken or proven to be insecure against the so-called structural attacks, i.e. attacks that aim to exploit the hidden structure in order to recover the private key. \r\nMy work is based on Generalized Srivastava codes and represents a generalization of the Quasi-Dyadic scheme proposed by Misoczki and Barreto, with two advantages: a better flexibility, and improved resistance to all the known attacks. An efficient implementation of the above scheme is also provided, as a result of a joint work with P.-L. Cayrel and G. Hoffmann.

\r\n\r\n

In the next chapters, other important aspects of code-based cryptography are investigated. These include the study of a higher security standard, called indistinguishability under a chosen ciphertext attack, in the standard model, and th[...]


06:14 [PhD][Update] Dwaine Clarke: Towards Constant Bandwidth Overhead Integrity Checking of Untrusted Data

  Name: Dwaine Clarke
Topic: Towards Constant Bandwidth Overhead Integrity Checking of Untrusted Data
Category:(no category)