International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) 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).

21:17 [Pub][ePrint] VLSI Implementation of Double-Base Scalar Multiplication on a Twisted Edwards Curve with an Efficiently Computable Endomorphism, by Zhe Liu and Husen Wang and Johann Gro{\\ss}sch{\\\"a}dl and Zhi Hu a

  The verification of an ECDSA signature requires a double-base scalar multiplication, an operation of the form $k \\cdot G + l \\cdot Q$ where $G$ is a generator of a large elliptic curve group of prime order $n$, $Q$ is an arbitrary element of said group, and $k$, $l$ are two integers in the range of $[1, n-1]$. We introduce in this paper an area-optimized VLSI design of a Prime-Field Arithmetic Unit (PFAU) that can serve as a loosely-coupled or tightly-coupled hardware accelerator in a system-on-chip to speed up the execution of double-base scalar multiplication. Our design is optimized for twisted Edwards curves with an efficiently computable endomorphism that allows one to reduce the number of point doublings by some 50% compared to a conventional implementation. An example for such a special curve is $-x^2 + y^2 = 1 + x^2y^2$ over the 207-bit prime field $F_p$ with $p = 2^{207} - 5131$. The PFAU prototype we describe in this paper features a ($16 \\times 16$)-bit multiplier and has an overall silicon area of 5821 gates when synthesized with a $0.13\\mu$ standard-cell library. It can be clocked with a frequency of up to 50 MHz and is capable to perform a constant-time multiplication in the mentioned 207-bit prime field in only 198 clock cycles. A complete double-base scalar multiplication has an execution time of some 365k cycles and requires the pre-computation of 15 points. Our design supports many trade-offs between performance and RAM requirements, which is a highly desirable property for future Internet-of-Things (IoT) applications.

21:17 [Pub][ePrint] Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation, by Marina Blanton and Fattaneh Bayatbabolghani

  Computation based on genomic data is becoming increasingly popular today, be

it for medical or other purposes such as ancestry or paternity testing.

Non-medical uses of genomic data in a computation often take place in a

server-mediated setting where the server offers the ability for joint

genomic testing between the users. Undeniably, genomic data is highly

sensitive, which in contrast to other biometry types, discloses a plethora

of information not only about the data owner, but also about his or her

relatives. Thus, there is an urgent need to protect genomic data, especially

when it is used in computation for what we call as recreational

non-health-related purposes. Towards this goal, in this work we put forward

a framework for server-aided secure two-party computation with the security

model motivated by genomic applications. One particular security setting

that we treat in this work provides stronger security guarantees with

respect to malicious users than the traditional malicious model. In

particular, we incorporate certified inputs into secure computation based on

garbled circuit evaluation to guarantee that a malicious user is unable to

modify her inputs in order to learn unauthorized information about the other

user\'s data.

Our solutions are general in the sense that they can be used to securely

evaluate arbitrary functions and offer attractive performance compared to

the state of the art. We apply the general constructions to three specific

types of genomic tests: paternity, genetic compatibility, and ancestry

testing and implement the constructions. The results show that all such

private tests can be executed within a matter of seconds or less despite the

large size of one\'s genomic data.

21:17 [Pub][ePrint] On the Implementation of Unified Arithmetic on Binary Huff Curves, by Santosh Ghosh, Amit Kumar, Amitabh Das and Ingrid Verbauwhede

  Unified formula for computing elliptic curve point addition and doubling are considered to be resistant against simple power-analysis attack. A new elliptic curve formula known as unified binary Huff curve in this regard has appeared into the literature in 2011. This paper is devoted to analyzing the applicability of this elliptic curve in practice. Our paper has two contributions. We provide an efficient implementation of the unified Huff formula in projective coordinates on FPGA. Secondly, we point out its side-channel vulnerability and show the results of an actual attack. It is claimed that the formula is unified and there will

be no power consumption difference when computing point addition and point doubling operations, observable with simple power analysis (SPA). In this paper, we contradict their claim showing actual SPA results on a FPGA platform and propose a modified arithmetic and its suitable implementation technique to overcome the vulnerability.

21:17 [Pub][ePrint] FIDES: Lightweight Authenticated Cipher with Side-Channel Resistance for Constrained Hardware, by Begül Bilgin and Andrey Bogdanov and Miroslav Knezević and Florian Mendel and Qingju Wang

  In this paper, we present a novel lightweight authenticated cipher optimized for hardware implementations called FIDES. It is an online nonce-based authenticated encryption scheme with authenticated data whose area requirements are as low as 793 GE and 1001 GE for 80-bit and 96-bit security, respectively. This is at least two times smaller than its closest competitors Hummingbird-2 and Grain-128a. While being extremely compact, Fides is both throughput and latency efficient, even in its most serial implementations. This is attained by our novel sponge-like design approach. Moreover, cryptographically optimal 5-bit and 6-bit S-boxes are used as basic nonlinear components while paying a special attention on the simplicity of providing first order side-channel resistance with threshold implementation.

21:17 [Pub][ePrint] Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices, by Stefan Heyse and Ingo von Maurich and Tim Güneysu

  In the last years code-based cryptosystems were established as promising alternatives for asymmetric cryptography since they base their security on well-known NP-hard problems and still show decent performance on a wide range of computing platforms. The main drawback of code-based schemes, including the popular proposals by McEliece and Niederreiter, are the large keys whose size is inherently determined by the underlying code. In a very recent approach, Misoczki et al. proposed to use quasi-cyclic MDPC (QC-MDPC) codes that allow for a very compact key representation. In this work, we investigate novel implementations of the McEliece scheme using such QC-MDPC codes tailored for embedded devices, namely a Xilinx Virtex-6 FPGA and an 8-bit AVR microcontroller. In particular, we evaluate and improve different approaches to decode QC-MDPC codes. Besides competitive performance for encryption and decryption on the FPGA, we achieved a very compact implementation on the microcontroller using only 4,800 and 9,600 bits for the public and secret key at 80 bits of equivalent symmetric security.

21:17 [Pub][ePrint] Complementing Feistel Ciphers, by Alex Biryukov and Ivica Nikolic

  In this paper, we propose related-key differential distinguishers based on the complementation property of Feistel ciphers. We show that with relaxed requirements on the complementation, i.e. the property does not have to hold for all keys and the complementation does not have to be on all bits, one can obtain a variety of distinguishers. We formulate criteria sufficient for attacks based on the complementation property. To stress the importance of our findings we provide analysis of the \\textit{full-round} primitives:

* For the hash mode of \\camo without $FL,FL^{-1}$ layers, differential multicollisions with $2^{112}$ time

* For GOST, practical recovery of the full key with 31 related keys and $2^{38}$ time/data

21:17 [Pub][ePrint] A High Reliability PUF Using Hot Carrier Injection Based Response Reinforcement, by Mudit Bhargava and Ken Mai

  Achieving high reliability across environmental variations and over aging in physical unclonable functions (PUFs) remains a challenge for PUF designers. The conventional method to improve PUF reliability is to use powerful error correction codes (ECC) to correct the errors in the raw response from the PUF core. Unfortunately, these ECC blocks generally have high VLSI overheads, which scale up quickly with the error correction capability. Alternately, researchers have proposed techniques to increase the reliability of the PUF core, and thus significantly reduce the required strength (and complexity) of the ECC. One method of increasing the reliability of the PUF core is to use normally detrimental IC aging effects to reinforce the desired (or \"golden\") response of the PUF by altering the PUF circuit characteristics permanently and hence making the PUF more reliable. In this work, we present a PUF response reinforcement technique based on hot carrier injection (HCI) which can reinforce the PUF golden response in short stress times (i.e., tens of seconds), without impacting the surrounding circuits, and that has high permanence (i.e., does not degrade significantly over aging). We present a self-contained HCI-reinforcement-enabled PUF circuit based on sense amplifiers (SA) which autonomously self-reinforces with minimal external intervention. We have fabricated a custom ASIC testchip in 65nm bulk CMOS with the proposed PUF design. Measured results show high reliability across environmental variations and accelerated aging, as well as good uniqueness and randomness. For example, 1600 SA elements, after being HCI stressed for 125s, show 100% reliability (zero errors) across ±20% voltage variations a temperature range of -20C to 85C.

12:49 [PhD][New] Nishant Doshi: Investigating Approaches for Improving the Ciphertext Policy Attribute Based Encryption

  Name: Nishant Doshi
Topic: Investigating Approaches for Improving the Ciphertext Policy Attribute Based Encryption
Category: public-key cryptography


In Ciphertext Policy Attribute Based Encryption (CP-ABE), a secret key of the user as well as the ciphertext (CT) is defined based on the attributes. A user is able to decrypt the ciphertext if and only if the attributes within a policy of ciphertext are satisfied by the attributes of the secret key. If we increase the number of attributes in the policy of ciphertext than the size of final ciphertext will also increase and subsequently leads to communication overhead as well as computational overhead at the receiver side. Hence, it is desirable to ensure constant ciphertext length in CP-ABE. However, the existing schemes in constant CT length proposed so far achieve only a selective security model i.e. the attacker must announce the target access policy before seeing the public parameter. This leads to a weaker security model. Therefore, we propose the fully secure CP-ABE, which requires the attribute set of ciphertext to be a subset of user’s secret key.


One more limitation of the schemes in constant CT length proposed so far is that they are based on a single authority approach. To deal with a single point of failure in a such a scheme, we propose a multi-authority CP-ABE scheme, with the support for any arbitrary numbers of attribute authorities under a central authority.


Additionally in the CP-ABE scheme, the receiver’s anonymity is sacrificed as the access structure of the ciphertext reveals the same. The obvious solution to this problem is to hide ciphertext-policy (hidden access structure). However, although this solution uses reasonably computable decryption policies, it generates the ciphertext of a size that is at least, linearly varying with the number of attributes.


We investigate such issues and propose a novel approach to deal with constant ciphertext length. Thereafter we extend the same approach to provide support for the mult[...]

15:24 [Job][New] Full Professor (W3) in Information Security, University of Stuttgart, Germany

  The professor is expected to conduct excellent research and teaching in the field of information security. Candidates are sought with extensive expertise in some of the following areas: Data Security and Privacy, Trustworthy Systems, Security Protocols and Cryptographic Methods, Security Engineering und Security Management, Provable Security, Certification of IT-Security.

We expect our new colleague to contribute to undergraduate and graduate teaching in the degree programs of Computer Science and Software Technology, in international master programs, as well as in courses for programs of other departments.

The requirements for employment listed in § 47 and § 50 Baden-Württemberg university law apply.

13:25 [PhD][New] Damien Vergnaud

  Name: Damien Vergnaud

13:24 [PhD][Update] Aurore Guillevic: Arithmetic of pairings on algebraic curves for cryptography

  Name: Aurore Guillevic
Topic: Arithmetic of pairings on algebraic curves for cryptography
Category:public-key cryptography

Description: Since 2000 pairings became a very useful tool to design new protocols in cryptography. Short signatures and identity-based encryption became also practical thanks to these pairings. This thesis contains two parts. One part is about optimized pairing implementation on different elliptic curves according to the targeted protocol. Pairings are implemented on supersingular elliptic curves in large characteristic and on Barreto-Naehrig curves. The pairing library developed at Thales is used in a broadcast encryption scheme prototype. The prototype implements pairings over Barreto-Naehrig curves. Pairings over supersingular curves are much slower and have larger parameters. However these curves are interesting when implementing protocols which use composite-order elliptic curves (the group order is an RSA modulus). We implement two protocols that use pairings on composite-order groups and compare the benchmarks and the parameter size with their counterpart in a prime-order setting. The composite-order case is 30 up to 250 times much slower according to the considered step in the protocols: the efficiency difference in between the two cases is very important. A second part in this thesis is about two families of genus 2 curves. Their Jacobians are isogenous to the product of two elliptic curves over a small extension field. The properties of elliptic curves can be translated to the Jacobians thanks to this isogeny. Point counting is as easy as for elliptic curves in this case. We also construct two endomorphisms both on the Jacobians and the elliptic curves. These endomorphisms can be used for scalar multiplication improved with a four-dimensional Gallant-Lambert-Vanstone method.[...]