Applied Crypto Group
Tuesday, February 25th, 2020, 10:00 AM: Claire Delaplace (Ruhr University Bochum, Germany)
Room MNO 1.030, Belval CampusTitle: Improved LowMemory Subset Sum and LPN Algorithms via Multiple Collisions
Abstract: For enabling postquantum cryptanalytic experiments on a meaningful scale, there is a strong need for lowmemory algorithms. We show that the combination of techniques from representations, multiple collisions finding, and the SchroeppelShamir algorithm leads to improved lowmemory algorithms. For random subset sum instances $(a_1, \ldots, a_n,t)$ defined modulo $2^n$, our algorithms improve over the Dissection technique for small memory $M < 2^{0.02n}$ and in the midmemory regime $2^{0.13n} < M < 2^{0.2n}$. An application of our technique to LPN of dimension $k$ and constant error $p$ yields significant time complexity improvements over the DissectionBKW algorithm from Crypto 2018 for all memory parameters $M< 2^{0.35 \frac{k}{\log k}}$. This is joined work with Andre Esser and Alexander May, published at IMACC 2019.
Thursday, January 9th, 2020, 10:00 AM: Ilaria Chillotti (KU Leuven)
Room MNO 1.030, Belval CampusTitle: MultiKey Homomophic Encryption from TFHE (joint work with Hao Chen and Yongsoo Song).
Abstract: In this paper, we propose a MultiKey Homomorphic Encryption (MKHE) scheme by generalizing the lowlatency homomorphic encryption by Chillotti et al. (ASIACRYPT 2016). Our scheme can evaluate a binary gate on ciphertexts encrypted under different keys followed by a bootstrapping. The biggest challenge to meeting the goal is to design a multiplication between a bootstrapping key of a single party and a multikey RLWE ciphertext. We propose two different algorithms for this hybrid product. Our first method improves the ciphertext extension by Mukherjee and Wichs (EUROCRYPT 2016) to provide better performance. The other one is a whole new approach which has advantages in storage, complexity, and noise growth. Compared to previous work, our construction is more efficient in terms of both asymptotic and concrete complexity. The length of ciphertexts and the computational costs of a binary gate grow linearly and quadratically on the number of parties, respectively. We provide experimental results demonstrating the running time of a homomorphic NAND gate with bootstrapping. To the best of our knowledge, this is the first attempt in the literature to implement an MKHE scheme.
Monday, December 2nd, 2019, 14:00: Romain Gay (University of California, Berkeley)
Room MNO 1.030, Belval CampusTitle: Functional Encryption: a bottom up approach
Abstract: This talk will present recent advances in Functional Encryption, a cryptographic object that allows users to perform selective computation on the encrypted data. Namely, in a Functional Encryption scheme, it is possible to derive a key associated with a function f, which allows users to recover from an encryption of the message m, the value f(m), and nothing else. We will see a series of work that aims at building Functional Encryption from the ground up; that is, practical schemes that rely on mathematically sound assumptions, for restricted classes of functions that we show have interesting applications. We will present the work of [BCFG18], which builds the first publickey Functional Encryption that supports the generation of keys associated with degree2 polynomials, with succinct ciphertexts. We will show how such schemes can be used to perform private inference, as done in [RDGPP19]. Finally, we will talk about decentralizing Functional Encryption, as done in [CDGPP18].
[BCFG18]: https://eprint.iacr.org/2017/151 [RDGPP19]: https://arxiv.org/abs/1905.10214 [CDGPP18]: https://eprint.iacr.org/2017/989
Thursday, November 21st, 2019, 10:00 AM: Changmin Lee (ENS Lyon)
Room MNO 1.030, Belval CampusTitle: Cryptanalysis of FRS Obfuscation based on the CLT13 Multilinear Map
Abstract: We present classical polynomialtime attacks against the FRS branching program obfuscator of FernandoRasmussenSahai (Asiacrypt 17) (with one zerotest parameter), which is robust against all known classical cryptanalyses on obfuscators, when instantiated with the CLT13 multilinear map. To do that 1) We (heuristically) reproduce a new zerotest parameter from the original one and recover a secret message space. The new zerotest parameter mitigates parameter constraints of the message space recovering algorithm proposed by Coron and Notarnicola (Asiacrypt'19), so it enables us to directly apply the algorithm to the FRS obfuscation. 2) We propose two cryptanalyses of the FRS obfuscation based on the recovered message space. One analysis enables to obtain all secret elements of CLT13, but it requires extra parameter constraints. On the other hand, the other analysis shows that there exist two functionally equivalent programs such that their obfuscated programs are computationally distinguishable. Thus, the FRS scheme does not satisfy the desired security without any additional constraints.
Monday, November 11th, 2019, 10:00 AM: Benjamin Wesolowski (CWI)
Room MNO 1.030, Belval CampusTitle: Discrete logarithms in quasipolynomial time in finite fields of small characteristic
Abstract: We prove that the discrete logarithm problem can be solved in quasipolynomial expected time in the multiplicative group of finite fields of fixed characteristic. In 1987, Pomerance proved that this problem can be solve in expected subexponential time L(1/2). The following 30 years saw a number of heuristic improvements, but no provable results. The quasipolynomial complexity has been conjectured to be reachable since 2013, when a first heuristic algorithm was proposed by Barbulescu, Gaudry, Joux, and Thome. We prove this conjecture, and more generally that this problem can be solved in the field of cardinality $p^n$ in expected time $(pn)^{2 log_2(n)+O(1)}$.
Friday, May 11th, 2018, 10:30 AM: Claire Delaplace (University of Rennes, France)
Room MNOE0325110, Belval Campus.Title: Revisiting and Improving Algorithms for the 3XOR Problem
Abstract: The 3SUM problem is a wellknown problem in computer science and many geometric problems have been reduced to it. We study the 3XOR variant which is more cryptologically relevant. In this problem, the attacker is given blackbox access to three random functions $F$, $G$ and $H$ and she has to find three inputs $x$, $y$ and $z$ such that $F(x) \oplus G(y) \oplus H(z) = 0$. The 3XOR problem is a difficult case of the moregeneral klist birthday problem.
Wagner's celebrated klist birthday algorithm, and the ones inspired by it, work by querying the functions more than strictly necessary from an informationtheoretic point of view. This gives some leeway to target a solution of a specific form, at the expense of processing a huge amount of data. However, to handle such a huge amount of data can be very difficult in practice. This is why we first restricted our attention to solving the 3XOR problem for which the total number of queries to $F$, $G$ and $H$ is minimal. If they are $n$bit random functions, it is possible to solve the problem with roughly $O(2^{n/3})$ queries. In this setting, the folklore quadratic algorithm finds a solution after $O(2^{2n/3})$ operations.
We present a 3XOR algorithm that generalizes an idea of Joux, with complexity $O(2^{2n/3} / n)$ in time and $O(2^{n/3})$ in space. This algorithm is practical: it is up to 3 times faster than the quadratic algorithm. Furthermore, we show that it is possible to adapt this algorithm to any number of queries, so that it will always be at least as good as, if not better than, Wagner's descendants in the same settings. We also revisit a 3SUM algorithm by BaranDemainePatrascu which is asymptotically $n^2 / \log^2 n$ times faster than the quadratic algorithm when adapted to the 3XOR problem, but is otherwise completely impractical.
This is a joint work with PierreAlain Fouque and Charles Bouillaguet.
LACS Seminar, April 13th, 2018, 11:00 AM, room MNOE0325110, Belval Campus.
Benoit Cogliati. Provable security in symmetric cryptographyAbstract: Provable security is an essential part of both symmetric and publickey cryptography. Indeed, security proofs can increase confidence in the resistance of an algorithm against various types of attacks and justify its soundness. Moreover, theorems guide the choice of the security parameters in applications. In this context, tight security proofs are essential, since they prevent the use of unnecessarily high values for those parameters. In this talk, I will start by giving an overview of the indistinguishability notion and of the main theoretical models that are considered in symmetric cryptography. I will then illustrate these notions by presenting several results on the design of tweakable block ciphers, and on the construction of provably secure MACs based on block ciphers and tweakable block ciphers.
LACS Seminar, November 22nd, 2017, 10:30 AM, room MNOE0325110, Belval Campus.
Tancrede Lepoint. PostQuantum Cryptography using Module LatticesAbstract: Recent advances in quantum computing and the announcement by the National Institute of Standards and Technology (NIST) to define new standards for digitalsignature, encryption, and keyestablishment protocols, spurred on the design and analysis of many postquantum cryptographic schemes. One of the most efficient quantumresilient alternatives for the above basic primitives is that of lattice cryptography.
Many lattice cryptography schemes are based on the learningwitherror problem over a ring. Past works have described digital signature schemes, encryption schemes, and key encapsulation mechanisms in one of two ways. Either they set the ring as Z_q[x]/(x^n+1) or as Z_q^n. The former choice results in schemes based on the hardness of the RingLWE and RingSIS problems (or the NTRU problem), while the latter choice of parameters results in schemes based on the LWE and SIS problems. In this talk, we consider the general case of setting the ring to (Z_q[x]/(x^d+1))^m, and design schemes based on the ModuleLWE and ModuleSIS hardness assumption. First, we explain how module lattices enable to design cryptographic primitives that are not only simple to implement securely, conservatively designed, and have a small memory footprint, but are modular, i.e., easily enable to vary security while keeping the same core operations. Then, we present CRYSTALS, the Cryptographic Suite for Algebraic Lattices submitted to the NIST call for postquantum standards, that includes Kyber (Bos et al., 2017), a key encapsulation mechanism, and Dilithium (Ducas et al., 2017), a digital signature.
LACS Crypto Day, June 13th, 2017, room MSA 4.410, Belval campus
 10:00: Aleksei Udovenko. On division property cryptanalysis.
 10:30: Dmitry Khovratovich. BIP32Ed25519: Hierarchical Deterministic Keys over a Nonlinear Keyspace.
 11:00: Benoit Cogliati: Security proofs for symmetrickey constructions

11:30: Jun Wang. vdNets: Applying Very Deep Neural Networks to Encrypted Data
Abstract: Very deep neural networks have recently demonstrated startoftheart accuracy on very complex visual and speech recognition tasks. To those problems which involve sensitive data, e.g. medicine and finance, the privacy and security requirements may prevent the use of cloudbased machine learning service. To address this issue, a number of works have explored how to apply machine learning models, including neural networks, to encrypted data. Unfortunately, such works either focus on conventional machine learning models or shallow neural networks. In this paper, we describe the design and implementation of a secure multiparty computation (SMC) system called vdNets which allows performing a learned very deep and large neural network on encrypted data. We first demonstrate the ability of vdNets by applying GoogLeNet convolutional neural network \cite{szegedy2015going} to encrypted data, and analyze its computation and communication cost. GoogLeNet has 22 layers (approximately 100 independent sublayers) and overall 1.5 billion multiplyadds at inference time. We further discuss the bottleneck of vdNets and introduce different methods to eliminate or alleviate it. Our results provide compelling evidence that an SMC approach to very deep and large neural networks is worth pursuing.
 14:00: Moon Sung Lee. Attacks on Multilinear Maps
 14:30: Vincenzo Iovino. The Simplest Oblivious Transfer Protocol.

15:00: Alfredo Rial Duran. UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens
Abstract: Complex cryptographic protocols are often designed from simple cryptographic primitives, such as signature schemes, encryption schemes, verifiable random functions, and zeroknowledge proofs, by bridging between them with commitments to some of their inputs and outputs. Unfortunately, the known universally composable (UC) functionalities for commitments and the cryptographic primitives mentioned above do not allow such constructions of higherlevel protocols as hybrid protocols. Therefore, protocol designers typically resort to primitives with propertybased definitions, often resulting in complex monolithic security proofs that are prone to mistakes and hard to verify.
We address this gap by presenting a UC functionality for noninteractive commitments that enables modular constructions of complex protocols within the UC framework. We also show how the new functionality can be used to construct hybrid protocols that combine different UC functionalities and use commitments to ensure that the same inputs are provided to different functionalities.
We further provide UC functionalities for attribute tokens and revocation that can be used as building blocks together with our UC commitments. As an example of building a complex system from these new UC building blocks, we provide a construction (a hybrid protocol) of anonymous attribute tokens with revocation. Unlike existing accumulatorbased schemes, our scheme allows one to accumulate several revocation lists into a single commitment value and to hide the revocation status of a user from other users and verifiers.
Coauthors: Jan Camenisch, Maria Dubovitskaya.