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-05-29
07:10 [Conf][EC] Report on Eurocrypt 2012

 

Eurocrypt 2012 was held in Cambridge, UK, from April 15th to April 19th. The meeting was held in the UK to coincide with the 100th anniversary year of the birth of Alan Turing.

The Program co-Chairs were David Pointcheval and Thomas Johansson. The Eurocrypt 2012 Program Committee (PC) consisted of 32 members. There were 195 papers submitted to the conference. The PC eventually selected 41 submissions for presentation during the conference. The PC decided to give the Best Paper Award to Antoine Joux and Vanessa Vitse for their paper “Cover and Decomposition Index Calculus on Elliptic Curves made practical. Application to a previously unreachable curve over Fp6 .” The conference program also included two invited lectures: one by Antoine Joux entitled “A Tutorial on High-Performance Computing Applied to Cryptanalysis,” and the other by Alfred Menezes on “Another Look at Provable Security.”

The conference programme was augmented by a trip to Bletchley Park on Thursday afternoon, with the traditional free Tuesday afternoon being dispensed with. Attendance at Eurocrypt 2012 was quite high, with 412 registered attendees, up from 300 at Eurocrypt 2010.

The conference was supported by donations from BAE Systems/Detica, CESG, Cryptomathic, Good Technologies, Microsoft Research, Qualcomm, RIM, Trend Micro, Visa International and Voltage. The generous donations allowed the organizers to sponsor the attendance of around 60 young researchers.



05:30 [Job][New] Senior Researcher in the areas of Security and Privacy, NEC Labs in Heidelberg, Germany

  The focus is on research with industrial and academic partners in collaborative European projects and towards NEC internal product and prototype development. You will contribute to the design and development of new concepts in security. Your responsibilities include publications, IPR creation, and supervising students and interns.

We are looking for individuals with a broad background in Security and a good understanding of most of the following areas:

• Security protocols and applied cryptography

• Network and Cyber Security, especially secure management of distributed resources,

• Software Security and Web Security

• Resource monitoring and machine learning techniques for security applications

We expect a PhD. degree with an excellent publication record and some relevant professional experience in the security area.

The NEC Laboratories in Heidelberg (Germany) provide an excellent working environment supporting individual creativity as well as strong teamwork. English is the working language in the Laboratories.

00:17 [Pub][ePrint] Four Dimensional GLV via the Weil Restriction, by Aurore Guillevic and Sorina Ionica

  The Gallant-Lambert-Vanstone (GLV) algorithm uses efficiently computable

endomorphisms to accelerate the computation of scalar multiplication of

points on an abelian variety. Freeman and Satoh proposed for cryptographic use two families of genus 2 curves defined over $\\F_{p}$ which have the property that the corresponding

Jacobians are $(2,2)$-isogenous over an extension field to a product of elliptic curves defined over $\\F_{p^2}$. We exploit the relationship between the endomorphism rings of isogenous abelian varieties to exhibit efficiently computable endomorphisms on both the genus 2 Jacobian and the elliptic curve. This leads to a four dimensional GLV method on Freeman and Satoh\'s Jacobians and on two new families of elliptic curves defined over $\\F_{p^2}$.



00:17 [Pub][ePrint] Families of fast elliptic curves from Q-curves, by Benjamin Smith

  We construct new families of elliptic curves over \\(\\FF_{p^2}\\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant--Lambert--Vanstone (GLV) and Galbraith--Lin--Scott (GLS) endomorphisms.

Our construction is based on reducing \\(\\QQ\\)-curves---curves over quadratic number fields without complex multiplication, but with isogenies to their Galois conjugates---modulo inert primes.

As a first application of the general theory we construct, for every \\(p > 3\\), two one-parameter families of elliptic curves over \\(\\FF_{p^2}\\) equipped with endomorphisms that are faster than doubling.

Like GLS (which appears as a degenerate case of our construction), we offer the advantage over GLV of selecting from a much wider range of curves, and thus finding secure group orders when \\(p\\) is fixed. Unlike GLS, we also offer the possibility of constructing twist-secure curves.

Among our examples are prime-order curves equipped with fast endomorphisms, with almost-prime-order twists, over \\(\\FF_{p^2}\\) for \\(p = 2^{127}-1\\) and \\(p = 2^{255}-19\\).



00:17 [Pub][ePrint] Reducing Pairing Inversion to Exponentiation Inversion\\\\using Non-degenerate Auxiliary Pairing, by Seunghwan Chang and Hoon Hong and Eunjeong Lee and Hyang-Sook Lee

  The security of pairing-based cryptosystems is closely related to the difficulty of the pairing inversion problem. Building on previous works, we provide further contributions on the difficulty of pairing inversion.

In particular, we revisit the approach of Kanayama-Okamoto who modified exponentiation inversion and Miller inversion by considering an ``auxiliary\'\' pairing. First, by generalizing and simplifying Kanayama-Okamoto\'s approach, we provide a simpler approach for inverting generalized ate pairings of Vercauteren. Then we provide a complexity of the modified Miller inversion, showing that the complexity depends on the sum-norm of the integer vector defining the auxiliary pairing.

Next, we observe that the auxiliary pairings (choice of integer vectors) suggested by Kanayama-Okamoto are degenerate and thus the modified exponentiation inversion is expected to be harder than the original exponentiation inversion. We provide a

sufficient condition on the integer vector, in terms of its max norm, so that the corresponding auxiliary paring is non-degenerate.

Finally, we define an infinite set of curve parameters, which includes those of typical pairing friendly curves, and we show that, within those parameters, pairing inversion of arbitrarily given generalized ate pairing can be reduced to exponentiation inversion in polynomial time.



00:17 [Pub][ePrint] Keyed Side-Channel Based Hashing for IP Protection using Wavelets, by Timo Bartkewitz

  The protection of intelligent property (IP) is a challenging task, especially in secured embedded systems where program code that is supposed to be a plagiarism cannot be simply read-out for further inspection. This is even more aggravated if the original source code was modified to prevent comparisons of any kind. For instance, watermarks that are actually hidden in the code are at risk to be rendered useless if the attacker has full access to the original code and some knowledge about the watermark. The unlicensed use of patented algorithms is a further problem that belongs to IP plagiarism as well. A Recent work presented a framework based on perceptual hashing to detect intelligent property in hardware and software designs. In this work we consequently extend this framework to detect IP plagiarism in embedded systems that can reliably match contents even in the presence of attacks. Therefore, we propose an adapted signal feature extraction method, the wavelet transform, to form a keyed side-channel hash function.



00:17 [Pub][ePrint] Hybrid Approach for the Fast Verification for Improved Versions of the UOV and Rainbow Signature Schemes, by Albrecht Petzoldt

  Multivariate cryptography is one of the main candidates to guarantee the security of communication in the post-quantum era. Especially in the area of digital signatures, multivariate cryptography offers a wide range of practical schemes. In \\cite{PB12} and \\cite{PB13} Petzoldt et al. showed a way to speed up the verification process of improved variants of the UOV and Rainbow signature schemes. In this paper we show how we can do even better by a slight variation of their algorithms.



00:17 [Pub][ePrint] Certified computer-aided cryptography: efficient provably secure machine code from high-level implementations, by José Bacelar Almeida and Manuel Barbosa and Gilles Barthe and François Dupressoir

  We present a computer-aided framework for proving concrete security bounds for cryptographic machine code implementations. The front-end of the framework is an interactive verification tool that extends the EasyCrypt framework to reason about relational properties of C-like programs extended with idealised probabilistic operations in the style of code-based security proofs. The framework also incorporates an extension of the CompCert certified compiler to support trusted libraries providing complex arithmetic calculations or instantiating idealised components such as sampling operations. This certified compiler allows us to carry to executable code the security guarantees established at the high-level, and is also instrumented to detect when compilation may interfere with side-channel countermeasures deployed in source code.

We demonstrate the applicability of the framework with the RSA-OAEP encryption scheme, as standardized in PKCS#1 v2.1. The outcome is a rigorous analysis of the advantage of an adversary to break the security of assembly implementations of the algorithms specified by the standard. The example also provides two contributions of independent interest: it is the first application of computer-aided cryptographic tools to real-world security, and the first application of CompCert to cryptographic software.





2013-05-28
19:53 [Conf] Report on FDTC 2012

 

FDTC 2012 was held in Leuven, on Sun. 9-th of September 2012, by the Auditorium "Zeger Van Hee" in the "College De Valk" of K.U.Leuven. The workshop attracted 103 participants from 17 countries, in descending order, from Europe, Asia and North America. The technical program included 12 papers: two invited presentations, and 10 regular papers, categorized into four sessions, that were selected from 20 submissions. Each paper was reviewed by at least 3 reviewers and detailed discussions were later conducted to reach final decisions. Most of the presentation slides for the technical sessions are now available on the workshop website (http://conferenze.dei.polimi.it/FDTC12). The workshop proceedings were published by IEEE CS Press and are available on the IEEE Digital Library. Philippe Maurine from Université Montpellier 2 (France) and Bart Preneel from KU Leuven (Belgium), delivered the two invited lectures on the topics "Techniques for EM Fault Injection: Equipments and Experimental Results" and "It's not my Fault – on Fault Attacks on Symmetric Cryptography" respectively.

Guido Bertoni from STMicroelectronics (Italy) and Benedikt Gierlichs from K.U.Leuven (Belgium), were the program co-chairs. David Naccache from École Normale Supérieure (France) was the invited presentations chair. We thank the sponsors CNRS ParisTech and Riscure for their generous support and contributions to the success of the conference, as well as the staff of KU Leuven for their continuous support of FDTC and help with the local arrangements.