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.
In this paper we introduce a new meta-reduction technique, which allows to prove lower bounds for the large and very natural class of generic reductions. A generic reduction is independent of a particular representation of group elements. Most reductions in state-of-the-art security proofs have this desirable property. This new approach allows to show unconditionally that there is no tight generic reduction from any natural computational problem \\Pi defined over algebraic groups (including even interactive problems) to breaking Schnorr signatures, unless solving \\Pi is easy.
The Department of Mathematics and Computer Science of the Eindhoven University of Technology (TU/e) has a vacancy for a Tenure Track Assistant Professor position for five years in the Coding and Crypto group (section Discrete Mathematics, DM).
The tenure-track nature of the position will be as follows. The successful candidate will first be appointed for a fixed period of five years. Before the start of the contract, the department and the candidate negotiate a list of conditions for successful conversion. If the candidate meets these conditions at the end of the five years, the position becomes permanent; if not, the temporary position is not continued.