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-06-10
21:17 [Pub][ePrint] Linearly Homomorphic Structure-Preserving Signatures and Their Applications, by Benoit Libert and Thomas Peters and Marc Joye and Moti Yung

  Structure-preserving signatures (SPS) are signature schemes where messages, signatures and public keys all consist of elements of a group over which a bilinear map is efficiently computable. This property makes them useful in cryptographic protocols as they nicely compose with other algebraic tools (like the celebrated Groth-Sahai proof systems). In this paper, we consider SPS systems with homomorphic properties and suggest applications that have not been provided before (in particular, not by employing ordinary SPS). We build linearly homomorphic structure-preserving signatures under simple assumptions and show that the primitive makes it possible to verify the calculations performed by a server on outsourced encrypted data (i.e., combining secure computation and authenticated computation to allow reliable and secure cloud storage and computation, while freeing the client from retaining cleartext storage). Then, we give a generic construction of non-malleable (and actually simulation-sound) commitment from any linearly homomorphic SPS. This notably provides the first constant-size non-malleable commitment to group elements.



21:17 [Pub][ePrint] A Fast Implementation of the Optimal Ate Pairing over BN curve on Intel Haswell Processor, by Shigeo MITSUNARI

  We present an efficient implementation of the Optimal Ate Pairing on Barreto-Naehrig

curve over a 254-bit prime field on Intel Haswell processor.

Our library is able to compute the optimal ate pairing over a 254-bit prime field,

in just 1.17 million of clock cycles on a single core of an Intel Core i7-4700MQ(2.4GHz)

processor with TurboBoost technology disabled.



21:17 [Pub][ePrint] A New Class of Public Key Cryptosystems Constructed Based on Reed-Solomon Codes, K(XII)SE(1)PKC. -- Along with a presentation of K(XII)SE(1)PKC over the extension field extensively used for present da

  In this paper, we present a new class of public key cryptosystem based on Reed-Solomon codes, a member of the code based PKC(CBPKC), referred to as K(XII)SE(1)PKC. We show that K(XII)SE(1)PKC can be secure against the various attacks. Particularly we present a member of K(XII)SE(1)PKC constructed based on the Reed-Solomon code over the extension field , which is extensively used in the present day storage systems and the various digital transmission systems. In a sharp contrast with the conventional CBPKC that uses Goppa code, in K(XII)SE(1)PKC, we do not care for the security of the primitive polynominal that generates the Reed-Solomon code.The probabilistic scheme presented in this paper would yield a brand-new technique in the field of CBPKC.



21:17 [Pub][ePrint] On the Achievability of Simulation-Based Security for Functional Encryption, by Angelo De Caro and Vincenzo Iovino Abhishek Jain and Adam O\'Neill and Omer Paneth and Giuseppe Persiano

  This work attempts to clarify to what extent simulation-based security (SIM-security) is achievable for functional encryption (FE) and its relation to the weaker indistinguishability-based security (IND-security). Our main result is a compiler that transforms any FE scheme for the general circuit functionality (which we denote by circuit-FE) meeting indistinguishability-based security (IND-security) to a circuit-FE scheme meeting SIM-security, where:

\\begin{itemize}

\\item In the random oracle model, the resulting scheme is secure for an unbounded number of encryption and key queries, which is the strongest security level one can ask for.

\\item In the standard model, the resulting scheme is secure for a bounded number of encryption and non-adaptive key queries, but an \\emph{unbounded} number of adaptive key queries. This matches known impossibility results and improves upon Gorbunov et al. [CRYPTO\'12] (which is secure for a \\emph{bounded} number of adaptive key queries).

\\end{itemize}

Our compiler is inspired by the celebrated Fiat-Lapidot-Shamir paradigm [FOCS\'90] for obtaining zero-knowledge proof systems from witness-indistinguishable proof systems.

As it is currently unknown whether circuit-FE meeting IND-security exists, the purpose of this result is to establish that it remains a good target for future research despite known deficiencies of IND-security [Boneh et al. -- TCC\'11, O\'Neill -- ePrint \'10].

We also give a tailored construction of SIM-secure hidden vector encryption (HVE) in composite-order bilinear groups.

Finally, we revisit the known negative results for SIM-secure FE, extending them to natural weakenings of the security definition and thus providing essentially a full picture of the (in)achievability of SIM-secure FE.



21:17 [Pub][ePrint] Efficient eCK-secure Authenticated Key Exchange Protocols in the Standard Model, by Zheng Yang

  The extended Canetti-Krawczyk (eCK) security models, are widely used to provide security arguments for authenticated key exchange protocols that capture leakage of various kinds of secret information like the long-term private key and session-specific secret state. In this paper, we study the open problem on constructing eCK secure AKE protocol without random oracles and NAXOS like trick. A generic construction GC-KKN satisfying those requirements is first given relying on standard cryptographic primitives following the guideline of efficiency. On the second a concrete protocol is proposed which is the first eCK secure protocol in the standard model under both standard assumptions and post-specified peer setting. Both proposed schemes can be more efficiently implemented with secure device than previous eCK secure protocols in the standard model, where the secure device might be normally used to store the long-term private key and to implement codes of protocol which require to be resilience of states leakage.



21:17 [Pub][ePrint] Structural Evaluation of AES and Chosen-Key Distinguisher of 9-round AES-128, by Pierre-Alain Fouque and Jérémy Jean and Thomas Peyrin

  While the symmetric-key cryptography community has now a good

experience on how to build a secure and efficient fixed permutation,

it remains an open problem how to design a key-schedule for block

ciphers, as shown by the numerous candidates broken in the related-key

model or in a hash function setting. Provable security against

differential and linear cryptanalysis in the related-key scenario is

an important step towards a better understanding of its construction.

Using a structural analysis, we show that the full AES-128 cannot be

proven secure unless the exact coefficients of the MDS matrix and the

S-Box differential properties are taken into account since its

structure is vulnerable to a related-key differential attack. We then

exhibit a chosen-key distinguisher for AES-128 reduced to 9 rounds,

which solves an open problem of the symmetric community. We obtain

these results by revisiting algorithmic theory and graph-based ideas

to compute all the best differential characteristics in SPN ciphers,

with a special focus on AES-like ciphers subject to related-keys. We

use a variant of Dijkstra\'s algorithm to efficiently find the most

efficient related-key attacks on SPN ciphers with an algorithm linear

in the number of rounds.



21:17 [Pub][ePrint] On the Security of TLS-DH and TLS-RSA in the Standard Model, by Florian Kohlar and Sven Schäge and Jörg Schwenk

  TLS is the most important cryptographic protocol in the Internet. At CRYPTO 2012, Jager et al. presented the first proof of the unmodified TLS with ephemeral Diffie-Hellman key exchange (TLS-DHE) for mutual authentication. Since TLS cannot be proven secure under the classical definition of authenticated key exchange (AKE), they introduce a new security model called authenticated and confidential channel establishment (ACCE) that captures the security properties expected from TLS in practice. We extend this result in two ways. First we show that the cryptographic cores of the remaining ciphersuites, RSA encrypted key transport (TLS-RSA) and static Diffie-Hellman (TLS-DH), can be proven secure for mutual authentication in an extended ACCE model that also allows the adversary to register new public keys. In our security analysis we show that if TLS-RSA is instantiated with a CCA secure public key cryptosystem and TLS-DH is used in scenarios where a) the knowledge of secret key assumption holds or b) the adversary may not register new public keys at all, both ciphersuites can be proven secure in the standard model under standard security assumptions. Next, we present new and strong definitions of ACCE (and AKE) for server-only authentication which fit well into the general framework of Bellare-Rogaway-style models. We show that all three ciphersuites families do remain secure in this server-only setting. Our work identifies which primitives need to be exchanged in the TLS handshake to obtain strong security results under standard security assumptions (in the standard model) and may so help to guide future revisions of the TLS standard and make improvements to TLS\'s extensibility pay off.



21:17 [Pub][ePrint] Security in $O(2^n)$ for the Xor of Two Random Permutations\\\\ -- Proof with the standard $H$ technique--, by Jacques Patarin

  Xoring two permutations is a very simple way to construct pseudorandom functions from pseudorandom permutations. In~\\cite{P08a}, it is proved that we have security against CPA-2 attacks when $m \\ll O(2^n)$, where $m$ is the number of queries and $n$ is the number of bits of the inputs

and outputs of the bijections. In this paper, we will obtain similar (but slightly different) results by using the

``standard H technique\'\' instead of the ``$H_{\\sigma}$ technique\'\'. It will be interesting to

compare the two techniques, their similarities and the differences between the proofs and the

results.



20:44 [PhD][New] Martin M. Lauridsen: Lightweight Cryptography

  Name: Martin M. Lauridsen
Topic: Lightweight Cryptography
Category: secret-key cryptography



20:43 [PhD][New] Hao Chen

  Name: Hao Chen


20:42 [PhD][New] Christian Rechberger

  Name: Christian Rechberger