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).

17:51 [Event][New] IEEE IoT Journal, Special Issue on Security for IoT: the State of the Art

  Submission: 15 February 2014
Notification: 15 May 2014
From October 1 to October 15
More Information:

16:12 [Job][New] Digital Security Expert, Philips Research, Eindhoven, the Netherlands

  Philips Research in Eindhoven NL) is searching for a Digital Security Expert. Please visit the Philips career website for the full vacancy description.

Your Responsibilities

Most of our products are becoming connected to the cyber space. We are looking for top scientists with a strong mathematical background for strengthening our competences in digital cryptography and security and who can help us to build and offer competitive trusted solutions and services in Healthcare, Lifestyle and Lighting.

Your challenges and responsibilities will be:

- Inventing and validating in industrial project teams new digital security technologies for use in Philips products and services, making use of the Internet of Things and Cloud Computing;

- Creating innovation impact with your results in terms of intellectual property creation or research transfers into the business;

- Keeping our digital security competence at world-class level;

- Contributing to our research roadmap by new ideas and winning new proposals;

- Working together with external partners.

Your Team

For more insights you can visit:

We are looking for

The successful candidate has/is:

- A PhD in mathematics or computer science and a strong inclination to cryptography, preferably proven by relevant scientific results;

- Proven practical skills in computer simulation, system architecting and computer programming;

- Practical experiences in industry;

- A strong team playing attitude, expressed in taking the lead where appropriate, building on each other’s strengths and working in a cooperative way;

- A self-propelled enthusiast with a can-do mentality.Takes ownership for making it happen;

- Good communication skills and fluent in English.

22:17 [Pub][ePrint] Distributed Key Generation for Secure Encrypted Deduplication, by Yitao Duan

  Large-scale storage systems often attempt to achieve two seemingly conflicting goals: (1) the systems need to reduce the copies of redundant data to save space, a process called deduplication; and (2) users demand encryption of their data to ensure privacy. Conventional encryption makes deduplication on ciphertexts ineffective, as it destroys data redundancy. A line of work, originated from Convergent

Encryption [28], and evolved into Message Locked Encryption [12], strives to solve this problem. The latest work, DupLESS [11], proposes a server-aided architecture that provides the strongest privacy. The DupLESS architecture relies on a key server to help the clients generate encryption keys that result in convergent ciphertexts. In this paper, we first provide a rigorous proof of security, in the random oracle model, for the DupLESS architecture which is lacking in the original paper. Our proof shows that using additional secret, other than the data itself, for generating encryption keys achieves the best possible security under current deduplication paradigm.We then introduce a distributed protocol that eliminates the need for a key server and allows less managed systems such as P2P systems to enjoy the high security level. Implementation and evaluation show that the scheme is both robust and practical.

22:17 [Pub][ePrint] Differential Indistinguishability for Cryptographic Primitives with Imperfect Randomness, by Michael Backes and Aniket Kate and Sebastian Meiser and Tim Ruffing

  Indistinguishability-based definitions of cryptographic primitives such as encryption, commitments, and zero-knowledge proofs are proven to be impossible to realize in scenarios where parties only have access to non-extractable sources of randomness (Dodis et al., FOCS 2004). In this work we demonstrate that it is, nevertheless, possible to quantify this secrecy loss for non-extractable sources such as the (well-studied) Santha-Vazirani (SV) sources. In particular, to establish meaningful security guarantees in scenarios where such imperfect randomness sources are used, we define and study differential indistinguishability, a generalization of indistinguishability inspired by the notion of differential privacy.

We analyze strengths and weaknesses of differential indistinguishability both individually as well as under composition, and we interpret the resulting differential security guarantees for encryption, commitments, and zero-knowledge proofs.

Surprisingly, indistinguishability with uniform randomness carries over to differential indistinguishability with SV randomness: We show that all primitives that are secure under a traditional indistinguishibility-based definition are differentially secure when they use (a bounded amount of) SV randomness instead of uniform randomness.

22:17 [Pub][ePrint] Riding the Saddle Point: asymptotics of the capacity-achieving simple decoder for bias-based traitor tracing, by Sarah Ibrahimi and Boris Skoric and Jan-Jaap Oosterwijk

  We study the asymptotic-capacity-achieving score function that was recently proposed by Oosterwijk et al. for bias-based traitor tracing codes. For the bias function we choose the Dirichlet distribution with a cutoff. Using Bernstein\'s inequality and Bennett\'s inequality, we upper bound the false positive and false negative error probabilities. From these bounds we derive sufficient conditions for the scheme parameters. We solve these conditions in the limit of large coalition size $c_0$ and obtain asymptotic solutions for the cutoff, the sufficient code length and the corresponding accusation threshold.

The code length converges to its asymptote approximately as $c_0^{-1/2}$, which is faster than the $c_0^{-1/3}$ of Tardos\' score function.

22:17 [Pub][ePrint] Formal Analysis of CRT-RSA Vigilant\'s Countermeasure Against the BellCoRe Attack, by Pablo Rauzy and Sylvain Guilley

  In our paper at PROOFS 2013, we formally studied a few known countermeasures to protect CRT-RSA against the BellCoRe fault injection attack. However, we left Vigilant\'s countermeasure and its alleged repaired version by Coron et al. as future work, because the arithmetical framework of our tool was not sufficiently powerful. In this paper we bridge this gap and then use the same methodology to formally study both versions of the countermeasure. We obtain surprising results, which we believe demonstrate the importance of formal analysis in the field of implementation security. Indeed, the original version of Vigilant\'s countermeasure is actually broken, but not as much as Coron et al. thought it was. As a consequence, the repaired version they proposed can be simplified. It can actually be simplified even further as two of the nine modular verifications happen to be unnecessary. Fortunately, we could formally prove the simplified repaired version to be resistant to the BellCoRe attack, which was considered a \"challenging issue\" by the authors of the countermeasure themselves.

22:17 [Pub][ePrint] Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol, by Susumu Kiyoshima and Yoshifumi Manabe and Tatsuaki Okamoto

  We present the first general MPC protocol that satisfies the following: (1) the construction is black-box, (2) the protocol is universally composable in the plain model, and (3) the number of rounds is constant. The security of our protocol is proven in angel-based UC security under the assumption of the existence of one-way functions that are secure against sub-exponential-time adversaries and constant-round semi-honest oblivious transfer protocols that are secure against quasi-polynomial-time adversaries. We obtain the MPC protocol by constructing a constant-round CCA-secure commitment scheme in a black-box way under the assumption of the existence of one-way functions that are secure against sub-exponential-time adversaries. To justify the use of such a sub-exponential hardness assumption in obtaining our constant-round CCA-secure commitment scheme, we show that if black-box reductions are used, there does not exist any constant-round CCA-secure commitment scheme under any falsifiable polynomial-time hardness assumptions.

22:17 [Pub][ePrint] A Note on Bilinear Groups of a Large Composite Order, by Zhengjun Cao and Lihua Liu

  We remark that the structure of bilinear groups of a large composite order(at least 1024 bits) could make group operation inefficient and lose the advantages of elliptic curve cryptography which gained mainly from smaller parameter size. As of 2013, the longest parameter recommended by NIST for elliptic curves has 571 bits.

From the practical point of view, such an algebraic structure is unlikely applicable to cryptographic schemes.

22:17 [Pub][ePrint] Multi-ciphersuite security and the SSH protocol, by Benjamin Dowling and Florian Giesen and Florian Kohlar and Jörg Schwenk and Douglas Stebila

  Real-world cryptographic protocols, such as the Transport Layer Security (TLS) and Secure Shell (SSH) protocols, support the negotiation of different combinations of cryptographic algorithms, often known as ciphersuites. An individual ciphersuite can be modelled as an authenticated and confidential channel establishment (ACCE) protocol, and recently all widely deployed TLS ciphersuites have been individually proven ACCE-secure. In practice, users often re-use long-term keys across ciphersuites, for example using the same digital signature key in two different signed Diffie--Hellman (DH) ciphersuites. Recently, a cross-ciphersuite attack on TLS was discovered in which a signed elliptic curve DH structure can be interpreted as a signed finite-field DH structure, breaking authentication. Thus, ACCE security of individual ciphersuites does not generically imply collective security when long-term keys are re-used across ciphersuites.

We investigate the security of multi-ciphersuite protocols with re-used long-term keys. We show how to \"open\" the ACCE definition slightly so that, after each ciphersuites has been proven secure individually, they can then be used together in a secure multi-ciphersuite protocol, even when long-term keys are re-used across ciphersuites, provided the ciphersuites\' messages satisfy an independence property. We apply our definitions and composition theorem to the SSH protocol, showing that signed Diffie--Hellman SSH ciphersuites are individually ACCE-secure; they also satisfy the preconditions of our composition theorem, and thus SSH is multi-ciphersuite-secure even with re-use of long-term keys.

22:17 [Pub][ePrint] RDAS: A Symmetric Key Scheme for Authenticated Query Processing in Outsourced Databases, by Lil Maria Rodriguez-Henriquez and Debrup Chakraborty

  In this paper we address the problem of authenticated query processing in outsourced databases.

An authenticated query processing mechanism allows a client to verify the validity of the query responses that it gets from an untrusted and remote server, who stores the client\'s database

on its behalf.

We introduce a general framework called RDAS for the problem of authenticated query processing, and define the

security goals for this task in line with concrete provable security. We propose several schemes which enable

a client to verify both the completeness and correctness of the query responses of a server. All the schemes follow

the proposed framework and are provably secure in terms of the proposed security definition. The novelty of the proposed schemes

is that they use bitmap indexes as a main component for providing authentication. Bitmap indexes have recently seen

lot of applications for accelerated query processing and many commercial databases implement such indexes. Bitmaps have not been

previously used for a security goal. We show that the proposed schemes can match in both

functionality and efficiency compared to the existing schemes. We also implement the schemes on a real database and provide extensive

experimental studies on the schemes

22:17 [Pub][ePrint] Iterated group products and leakage resilience against NC^1, by Eric Miles

  We show that if NC^1 \\neq L, then for every element g of the alternating group A_t, circuits of depth O(log t) cannot distinguish between a uniform vector over (A_t)^t with product = g and one with product = identity. Combined with a recent construction by the author and Viola in the setting of leakage-resilient cryptography [STOC \'13], this gives a compiler that produces circuits withstanding leakage from NC^1 (assuming NC^1 \\neq L). For context, leakage from NC^1 breaks nearly all previous constructions, and security against leakage from P is impossible.

We build on work by Cook and McKenzie [J.\\ Algorithms \'87] establishing the relationship between L = logarithmic space and the symmetric group S_t. Our techniques include a novel algorithmic use of commutators to manipulate the cycle structure of permutations in A_t.