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] Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions, by Susumu Kiyoshima

  Concurrent non-malleable zero-knowledge (CNMZK) protocols are zero-knowledge protocols that are secure even against adversaries that interact with multiple provers and verifiers simultaneously. Recently, the first statistical CNMZK argument for NP was constructed under the DDH assumption (Orlandi el al., TCC\'14).

In this paper, we construct a statistical CNMZK argument for NP assuming only the existence of one-way functions. The security is proven via black-box simulation, and the round complexity is poly(n). Under the existence of collision-resistant hash functions, the round complexity can be reduced to w(log n), which is known to be essentially optimal for black-box concurrent zero-knowledge protocols.

21:17 [Pub][ePrint] Who watches the watchmen? : Utilizing Performance Monitors for Compromising keys of RSA on Intel Platforms, by Sarani Bhattacharya, Debdeep Mukhopadhyay

  Asymmetric-key cryptographic algorithms when implemented

on systems with branch predictors, are subjected

to side-channel attacks

exploiting the deterministic branch

predictor behavior due to their key-dependent input sequences. We show that branch predictors can also

leak information through the hardware

performance monitors which are

accessible by an adversary at the

user-privilege level. This paper presents

an iterative attack which target the

key-bits of 1024 bit RSA, where in

offline phase, the system\'s underlying

branch predictor is approximated

by a theoretical predictor in literature.

Subsimulations are performed

to classify the message-space into

distinct partitions based on the event

branch misprediction and the target key

bit value. In online phase, we ascertain

the secret key bit using branch mispredictions

obtained from the hardware performance

monitors which reflect the information of branch

miss due to the underlying predictor hardware.

We theoretically prove that the probability

of success of the attack is equivalent to the accurate

modelling of the theoretical predictor to the underlying system predictor. Experimentations reveal that the

success-rate increases with message-count and reaches such a significant value so as to consider side-channel

from the performance counters as a real threat

to RSA-like ciphers due

to the underlying branch predictors and

needs to be considered for developing secured-systems.

21:17 [Pub][ePrint] Random Digit Representation of Integers, by Nicolas Méloni and M. Anwar Hasan

  Modular exponentiation is core to today\'s main stream

public key cryptographic systems. In this article, we generalize the

classical fractional $w$NAF method for modular exponentiation -- the

classical method uses a digit set of the form $\\{1,3,\\dots,m\\}$

which is extended here to any set of odd integers of the form

$\\{1,d_2,\\dots, d_n\\}$. We give a formula for the average density of

non-zero terms in this new representation and discuss its asymptotic

behavior when those digits are randomly chosen from a given set. We

also propose a specific method for the precomputation phase of the

exponentiation algorithm.

21:17 [Pub][ePrint] Design, Evaluation and Optimization of Physical Unclonable Functions based on Transient Effect Ring Oscillators, by Abdelkarim Cherkaoui, Lilian Bossuet and Cédric Marchand

  This paper proposes a theoretical study and a full

overview of the design, evaluation and optimization of a PUF

based on transient element ring oscillators (TERO-PUF). We

show how, by following some simple design rules and strategies,

designers can build and optimize a TERO-PUF with state of the

art PUF characteristics in a standard CMOS technology. To this

end, we analyzed the uniqueness, steadiness and randomness of

responses generated from 30 test chips in a CMOS 350nm process

in nominal and corner voltage and temperature conditions.

Response generation schemes are proposed to optimize PUF

performances and reduce its area without noticeable loss in its

output quality. In particular, we show that the large area of the

basic blocks in the TERO-PUF is balanced by the high level

of entropy extracted in each basic block. Thus, the length of

the response to the same challenge is increased. Guidelines are

provided to balance reliability and randomness of the responses

and the design area.

21:17 [Pub][ePrint] Automated Analysis and Synthesis of Authenticated Encryption Schemes, by Viet Tung Hoang and Jonathan Katz and Alex J. Malozemoff

  Authenticated encryption (AE) schemes are symmetric-key encryption schemes ensuring strong notions of confidentiality and integrity. Although various AE schemes are known, there remains significant interest in developing schemes that are more efficient, meet even stronger security notions (e.g., misuse-resistance), or satisfy certain non-cryptographic properties (e.g., being patent-free).

We present an automated approach for analyzing and synthesizing blockcipher-based AE schemes, significantly extending prior work by Malozemoff et al. (CSF 2014) who synthesize encryption schemes satisfying confidentiality only. Our main insight is to restrict attention to a certain class of schemes that is expressive enough to capture several known constructions yet also admits automated reasoning about security. We use our approach to generate thousands of AE schemes with provable security guarantees, both known (e.g., variants of OCB and CCM) and new. Implementing two of these new schemes, we find their performance competitive with state-of-the-art AE schemes.

21:17 [Pub][ePrint] Ed448-Goldilocks, a new elliptic curve, by Mike Hamburg

  Many papers have proposed elliptic curves which are faster and easier to implement than the NIST prime-order curves. Most of these curves have had fields of size around $2^256$, and thus security estimates of around 128 bits. Recently there has been interest in a stronger curve, prompting designs such as Curve41417 and Microsoft\'s pseudo-Mersenne-prime curves.

Here I report on the design of another strong curve, called Ed448-Goldilocks. Implementations of this curve can perform very well for its security level on many architectures. As of this writing, this curve is favored by IRTF CFRG for inclusion in future versions of TLS along with Curve25519.

21:17 [Pub][ePrint] Practical Round-Optimal Blind Signatures in the Standard Model, by Georg Fuchsbauer and Christian Hanser and Daniel Slamanig

  Round-optimal blind signatures are notoriously hard to construct in the standard model, especially in the malicious-signer model, where blindness must hold under adversarially chosen keys. This is substantiated by several impossibility results. The only construction that can be termed theoretically efficient, by Garg and Gupta (Eurocrypt\'14), requires complexity leveraging, inducing an exponential security loss.

We present a construction of practically efficient round-optimal blind signatures in the standard model. It is conceptually simple and builds on the recent structure-preserving signatures on equivalence classes (SPS-EQ) from Asiacrypt\'14. While the traditional notion of blindness follows from standard assumptions, we prove blindness under adversarially chosen keys under an interactive variant of DDH. However, we neither require non-uniform assumptions nor complexity leveraging.

We then show how to extend our construction to partially blind signatures and to blind signatures on message vectors, which yield a construction of one-show anonymous credentials à la \"anonymous credentials light\" (CCS\'13) in the standard model.

Furthermore, we give the first SPS-EQ construction under non-interactive assumptions and show how SPS-EQ schemes imply conventional structure-preserving signatures, which allows us to apply optimality results for the latter to SPS-EQ.

21:17 [Pub][ePrint] On Necessary Padding with IO, by Justin Holmgren

  We show that the common proof technique of padding a circuit before IO obfuscation is sometimes necessary. That is, assuming indistinguishability obfuscation (IO) and one-way functions exist, we define samplers Sam_0, which outputs (aux_0, C_0), and Sam_1, which outputs (aux_1, C_1) such that:

- The distributions (aux_0, iO(C_0)) and (aux_1, iO(C_1)) are perfectly distinguishable.

- For padding s = poly(lambda)$, the distributions (aux_0, iO(C_0||0^s)) and (aux_1, iO(C_1||0^s)) are computationally indistinguishable.

We note this refutes the recent \"Superfluous Padding Assumption\" of Brzuska and Mittelbach.

21:17 [Pub][ePrint] An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme, by Daniel Cabarcas and Denise Demirel and Florian Göpfert and Jean Lancrenon and Thomas Wunderer

  Commitment schemes are among cryptography\'s most important building blocks. Besides their basic properties, hidingness and bindingness, for many applications it is important that the schemes applied support proofs of knowledge. However, all existing solutions which have been proven to provide these protocols are only computationally hiding or are not resistant against quantum adversaries. This is not suitable for long-lived systems, such as long-term archives, where commitments have to provide security also in the long run. Thus, in this work we present a new post-quantum unconditionally hiding commitment scheme that supports (statistical) zero-knowledge protocols and allows to refreshes the binding property over time. The bindingness of our construction relies on the approximate shortest vector problem, a lattice problem which is conjectured to be hard for polynomial approximation factors, even for a quantum adversary. Furthermore, we provide a protocol that allows the committer to prolong the bindingness property of a given commitment, while showing in zero-knowledge fashion that the value committed to did not change. In addition, our construction yields two more interesting features: 1) the ability to \"convert\" a Pedersen commitment into a lattice-based one, and 2) the construction of a hybrid approach whose bindingness relies on the discrete logarithm

and approximate shortest vector problems.

21:17 [Pub][ePrint] BeleniosRF: A Strongly Receipt-Free Electronic Voting Scheme, by Véronique Cortier and Georg Fuchsbauer and David Galindo

  We propose a new voting scheme, BeleniosRF, that offers both strong receipt-freeness and end-to-end verifiability. It is strongly receipt-free in the sense that even dishonest voters cannot prove how they voted. We give a game-based definition capturing this property, inspired by and improving the original receipt-freeness definition by Benaloh and Tuinstra. Built upon the Helios protocol, BeleniosRF inherits from its simplicity.

21:17 [Pub][ePrint] Unconditionally Secure Computation with Reduced Interaction, by Ivan Damgård and Jesper Buus Nielsen

  We study the question of how much interaction is needed for unconditionally secure multiparty computation. We first consider the number of messages that need to be sent to compute a non-trivial function (such as the AND of several input bits), assuming that all players have input and get output. We show that for $n$ players and $t$ corruptions,

$n(t+3)/2$ messages is necessary, this holds already for semi-honest and static corruption. Note that for functions that can be securely computed in constant round, this bound is tight up to a constant factor. For the case $t=1$ and semi-honest security, we show that $2 n$ messages is also sufficient to compute a rich class of functions efficiently, showing that the bound is exact for $t=1$.

Next, we consider round complexity.

It is a long-standing open problem to determine whether all efficiently computable functions can also be efficiently computed in constant-round with {\\em unconditional} security. Providing a positive answer seems to require completely new ideas for protocol design. Motivated by this, we consider the question of whether we can compute any function securely, while minimizing the interaction of {\\em some of} the players? And if so, how many players can this apply to? Note that we still want the standard security guarantees (correctness, privacy, termination) and we consider the standard communication model with secure point-to-point channels. We answer the questions as follows: for passive security, with $n=2t+1$ players and $t$ corruptions, up to $t$ players can have minimal interaction, i.e., they send 1 message in the first round to each of the $t+1$ remaining players and receive one message from each of them in the last round. Using our result on message complexity, we show that this is (unconditionally) optimal. For malicious security with $n=3t+1$ players and $t$ corruptions, up to $t$ players can have minimal interaction, also this is shown to be optimal.