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

2012-07-11
12:23 [Job][Update] Teaching Position (Tenure), Salary A13/A14, Ruhr University Bochum, Germany

  At the RUB a teaching position (tenured) is open. The German job name is \\\"Akademischer Rat\\\", with a teaching load of 13 hours per week. This is a postdoc position, a Ph.D. degree is required.

This teching position is located at the chair for Network and Data Security (www.nds.rub.de). Applicants should have a strong publication record in the areas of cryptographic protocols, web security, or webservice security.

Due to the large teaching load, excellent knowledge of German language is reqired.



2012-07-09
11:49 [Job][New] Teaching Position (Tenure), Salary A13/A14, Ruhr University Bochum, Germany

  At the RUB a teaching position (tenured) is open. The German job name is \"Akademischer Rat\", with a teaching load of 13 hours per week. This is a postdoc position, a Ph.D. degree is required.

This teching position is located at the chair for Network and Data Security (www.nds.rub.de). Applicants should have a strong publication record in the areas of cryptographic protocols, web security, or webservice security.

Due to the large teaching load, excellent knowledge of German language is reqired.

05:48 [PhD][New] Tal Malkin

  Name: Tal Malkin


05:47 [PhD][New] Ilya Kizhvatov: Physical Security of Cryptographic Algorithm Implementations

  Name: Ilya Kizhvatov
Topic: Physical Security of Cryptographic Algorithm Implementations
Category: implementation

Description:

This thesis deals with physical attacks on implementations of cryptographic algorithms and countermeasures against these attacks. Physical attacks exploit properties of an implementation such as leakage through physically observable parameters (side-channel analysis) or susceptibility to errors (fault analysis) to recover secret cryptographic keys. In the absence of adequate countermeasures such attacks are often much more efficient than classical cryptanalytic attacks. Particularly vulnerable to physical attacks are embedded devices that implement cryptography in a variety of security-demanding applications.

\r\n

In the area of side-channel analysis, this thesis addresses attacks that exploit observations of power consumption or electromagnetic leakage of the device and target symmetric cryptographic algorithms (at the notable example of the Advanced Encryption Standard (AES)). First, this work proposes a new combination of two well-known techniques of such attacks: differential side-channel analysis and side-channel collision attacks. The combination is more efficient than each of the attacks individually. As a further improvement, new dimension reduction techniques for side-channel acquisitions are introduced for side-channel collision detection and compared using an information-theoretic metric. Second, this work studies attacks exploiting leakage induced by microprocessor cache mechanism. We present an algorithm for cache-collision attacks that can recover the secret key in the presence of uncertainties in cache event detection from side-channel acquisitions, which may happen in a noisy measurement environment. Third, practical side-channel attacks are discovered against the AES engine of the AVR XMEGA, a recent versatile microcontroller for a variety of embedded applications.

\r\n

In the area of fault analysis, this thesis extends existing attacks against the RSA digital signature algorithm implemented with the Chinese remainder theorem to a setti[...]


05:47 [PhD][New] Seung Geol Choi: On Adaptive Security and Round Efficiency in Secure Multi-party Computation

  Name: Seung Geol Choi
Topic: On Adaptive Security and Round Efficiency in Secure Multi-party Computation
Category: cryptographic protocols





2012-07-08
12:52 [Conf][Crypto] Early Registration Deadline for CRYPTO is TODAY!

  Link to online registration --

http://www.iacr.org/conferences/crypto2012/registration-2012.html



2012-07-06
21:17 [Pub][ePrint] Enhancing Location Privacy for Electric Vehicles (at the right time), by Joseph Liu and Man Ho Au and Willy Susilo and Jianying Zhou

  An electric vehicle is a promising and futuristic automobile propelled by electric motor(s), using electrical energy stored in batteries or another energy storage device. Due to the need of battery recharging, the cars will be required to visit recharging infrastructure very frequently. This may disclose the users\' private information, such as their location, which may expose users\' privacy. In this paper, we provide mechanisms to enhance location privacy of electric vehicles at the right time, by proposing an anonymous payment system

with privacy protection support. Our technique further allows traceability in the case where the cars are stolen.



21:17 [Pub][ePrint]

 

21:17 [Pub][ePrint] Construction of New Classes of Knapsack Type Public Key Cryptosystem Using Uniform Secret Sequence, K(II)$\\Sigma\\Pi$PKC, Constructed Based on Maximum Length Code, by Masao KASAHARA

  In this paper, we present a new class of knapsack type PKC referred to as K(II)$\\Sigma\\Pi$PKC.

In K(II)$\\Sigma\\Pi$PKC, Bob randomly constructs a very small subset of Alice\'s set of public key whose order is very large,

under the condition that the coding rate $\\rho$ satisfies $0.01 < \\rho < 0.5$.

In K(II)$\\Sigma\\Pi$PKC, no secret sequence such as super-increasing sequence or shifted-odd sequence but the sequence whose component is constructed by a product of the same number of many prime numbers of the same size, is used.

We show that K(II)$\\Sigma\\Pi$PKC is secure against the attacks such as LLL algorithm, Shamir\'s attack etc. , because a subset of Alice\'s public keys

is chosen entirely in a probabilistic manner at the sending end.

We also show that K(II)$\\Sigma\\Pi$PKC can be used as a member of the class of common key cryptosystems because the list

of the subset randomly chosen by Bob can be used as a common key between Bob and Alice,

provided that the conditions given in this paper are strictly observed,

without notifying Alice of his secret key through a particular secret channel.



21:17 [Pub][ePrint]

 

21:17 [Pub][ePrint] Edwards model of elliptic curves defined over any fields, by Oumar DIAO and Emmanuel FOUOTSA

  In this paper, we present a generalization of Edwards model for elliptic curve which is defined over any field and in particular for field of characteristic 2. This model generalize the well known Edwards model of \\cite{Edw07} over characteristic zero field, moreover it define an ordinary elliptic curve over binary fields.

For this, we use the theory of theta functions and an intermediate model embed in $\\mathbb{P}^3$ that we call a level $4$-theta model. We then present an arithmetic of this level $4$-theta model and of our Edwards model using Riemann relations of theta functions. The group laws are complete, i.e. none exceptional case for adding a pair of points; their are also unified, i.e. formulas using for addition and for doubling are the same. Over binary fields we have very efficient arithmetics on ordinary elliptic curve, but over odd field our explicit addition laws are not competitives. Nevertheless, we give efficient differential addition laws on level $4$-theta model and on Edwards model defined over any fields.