{"id":215,"date":"2020-10-22T16:18:36","date_gmt":"2020-10-22T14:18:36","guid":{"rendered":"https:\/\/jc2-2020.inria.fr\/?page_id=215"},"modified":"2020-11-02T12:10:51","modified_gmt":"2020-11-02T11:10:51","slug":"programme","status":"publish","type":"page","link":"https:\/\/jc2-2020.inria.fr\/en\/programme\/","title":{"rendered":"Program"},"content":{"rendered":"

You can download the program in pdf format from here<\/a>.<\/p>\n

 <\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

Monday November 2nd<\/h2>\n<\/th>\n<\/tr>\n

 <\/p>\n
9h30<\/div>\n
—<\/div>\n
10h30<\/div>\n<\/td>\n
Chair: Vanessa Vitse<\/td>\n<\/tr>\n
Jean
\nKieffer<\/td>\n		Calcul d\u2019isog\u00e9nies \u00e0 partir d\u2019\u00e9quations modulaires en genre 2<\/td>\n<\/tr>\n
Simon
\nMasson<\/td>\n		Verifiable Delay Functions from Supersingular Isogenies and Pairings<\/td>\n<\/tr>\n
Arthur
\nLavice<\/td>\n		Multiplication over extension fields for Pairing-based Cryptography: an Hardware Point of view<\/td>\n<\/tr>\n
10h30 — 10:45<\/span><\/td>\nBreak 15 minutes<\/td>\n<\/tr>\n
 <\/p>\n
10h45<\/div>\n
—<\/div>\n
11h00<\/div>\n<\/td>\n
Sulamithe
\nTsakou<\/td>\n		Attaque par calcul d\u2019indices sur les Jacobiennes de courbes hyperelliptiques munies d\u2019endomorphismes<\/td>\n<\/tr>\n
Youssef
\nEl Housni<\/td>\n		Optimized and secure pairing-friendly elliptic curve suitable for one layer proof composition<\/td>\n<\/tr>\n
Andy
\nRusson<\/td>\n		The quest for an exception-free windowing elliptic curve scalar multiplication<\/td>\n<\/tr>\n
 <\/p>\n
11h00<\/div>\n
—<\/div>\n
11h40<\/div>\n<\/td>\n
Chair: Sonia Bela\u00efd<\/td>\n<\/tr>\n
Lo\u00efc
\nMasure<\/td>\n		Vers une meilleure compr\u00e9hension de l\u2019apprentissage
\nprofond appliqu\u00e9 aux attaques par observation<\/td>\n<\/tr>\n
Nicolas
\nBordes<\/td>\n		High-order private multiplication in characteristic two revisited<\/td>\n<\/tr>\n
11h40 — 11:50<\/span><\/td>\nBreak 10 minutes<\/td>\n<\/tr>\n
 <\/p>\n
11h50<\/div>\n
—<\/div>\n
12h30<\/div>\n<\/td>\n
Lucas
\nBarthelemy<\/td>\n		Toward an Asymmetric White-Box Proposal<\/td>\n<\/tr>\n
Adel
\nHamdi<\/td>\n		Blind Functional Encryption<\/td>\n<\/tr>\n<\/tbody>\n
\n

Tuesday November 3rd<\/h2>\n<\/th>\n<\/tr>\n

 <\/p>\n
9h30<\/div>\n
—<\/div>\n
10h30<\/div>\n<\/td>\n
Chair: Christina Boura<\/td>\n<\/tr>\n
Paul Huynh<\/td>\nFeistel case: when the boomerang comes back<\/td>\n<\/tr>\n
Baptiste Lambin<\/td>\nLinearly equivalent S-boxes and the Division Property<\/td>\n<\/tr>\n
Victor Mollimard<\/td>\nEfficient Search for Optimal Diffusion Layers of Generalized Feistel Networks<\/td>\n<\/tr>\n
10h30 — 10:45<\/span><\/td>\nBreak 15 minutes<\/td>\n<\/tr>\n
 <\/p>\n
<\/div>\n
<\/div>\n
<\/div>\n
10h45<\/div>\n
—<\/div>\n
11h00<\/div>\n<\/td>\n
Durand Amaury<\/td>\nCodes duaux des codes de Reed-Solomon lin\u00e9aris\u00e9s dans le cadre differentiel<\/td>\n<\/tr>\n
Florette Martinez<\/td>\nQMDS codes with minimal length<\/td>\n<\/tr>\n
Maxime Bros<\/td>\nAn Algebraic Attack on Rank Metric Code-Based Cryptosystems<\/td>\n<\/tr>\n
 <\/p>\n
11h00<\/div>\n
—<\/div>\n
11h40<\/div>\n<\/td>\n
Chair: Claire Delaplace<\/td>\n<\/tr>\n
Katharina Boudgoust<\/td>\nOn the classical hardness of Module-LWE: the linear rank case<\/td>\n<\/tr>\n
Charbel Saliba<\/td>\nKey exchange based on Ring-LWE using Barnes-Wall lattices<\/td>\n<\/tr>\n
11h40 — 11:50<\/span><\/td>\nBreak 10 minutes<\/td>\n<\/tr>\n
 <\/p>\n
11h50<\/div>\n
—<\/div>\n
12h30<\/div>\n<\/td>\n
Andr\u00e9 Schrottenloher<\/td>\nQuantum Attacks without Superposition Queries: the Offline Simon\u2019s Algorithm<\/td>\n<\/tr>\n
Yixin Shen<\/td>\nBetter Quantum Algorithms for Subset-Sums<\/td>\n<\/tr>\n<\/tbody>\n
\n

Wednesday November 4th<\/h2>\n<\/th>\n<\/tr>\n

GA of GT C2<\/td>\n<\/tr>\n<\/tbody>\n
\n

Thursday November 5th<\/h2>\n<\/th>\n<\/tr>\n

 <\/p>\n
9h30<\/div>\n
—<\/div>\n
10h30<\/div>\n<\/td>\n
Chair: Eleonora Guerrini<\/td>\n<\/tr>\n
Weiqiang Wen<\/td>\nFaster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1\/(2k)) in Time k^(k\/8 + o(k))<\/td>\n<\/tr>\n
Gabrielle De Micheli<\/td>\nDiscrete logarithm algorithms in pairing-relevant finite fields<\/td>\n<\/tr>\n
Andrea Lesavourey<\/td>\nRetrieving short generators of principal ideals in real Kummer extensions<\/td>\n<\/tr>\n
10h30 — 10:45<\/span><\/td>\nBreak 15 minutes<\/td>\n<\/tr>\n
 <\/p>\n
<\/div>\n
<\/div>\n
<\/div>\n
10h45<\/div>\n
—<\/div>\n
11h00<\/div>\n<\/td>\n
Antonio Florez
\nGutierrez<\/td>\n		Improving the key recovery in linear cryptanalysis: An application to PRESENT<\/td>\n<\/tr>\n
Olivier Bernard<\/td>\nTwisted PHS: Using the product formula to solve Approx-SVP on ideal lattices<\/td>\n<\/tr>\n
Guillaume Kaim<\/td>\nPost-quantum e-voting scheme<\/td>\n<\/tr>\n
 <\/p>\n
11h00<\/div>\n
—<\/div>\n
11h40<\/div>\n<\/td>\n
Chair: Aurore Guillevic<\/td>\n<\/tr>\n
Isabella Panaccione<\/td>\nThe Power Error Locating Pairs algorithm<\/td>\n<\/tr>\n
Matthieu Lequesne<\/td>\nOn the security of subspace subcodes of Reed-Solomon codes for public key encryption<\/td>\n<\/tr>\n
11h40 — 11:50<\/span><\/td>\nBreak 10 minutes<\/td>\n<\/tr>\n
 <\/p>\n
11h50<\/div>\n
—<\/div>\n
12h30<\/div>\n<\/td>\n
Aude Le Gluher<\/td>\nComplexit\u00e9 asymptotique fine du crible alg\u00e9brique<\/td>\n<\/tr>\n
Manon Bertin<\/td>\nUnderstanding the complexity of an algebraic attack on the superdetermined DAGS system<\/td>\n<\/tr>\n<\/tbody>\n
\n

Friday November 6th<\/h2>\n<\/th>\n<\/tr>\n

 <\/p>\n
9h15<\/div>\n
—<\/div>\n
10h35<\/div>\n<\/td>\n
Chair: Malika Izabach\u00e8ne<\/td>\n<\/tr>\n
Ida Tucker<\/td>\nBandwith efficient threshold ECDSA<\/td>\n<\/tr>\n
Chlo\u00e9 H\u00e9bant<\/td>\nLinearly-Homomorphic Signatures and Scalable Mix-Nets<\/td>\n<\/tr>\n
R\u00e9mi Clarisse<\/td>\nEfficacit\u00e9 globale des protocoles \u00e0 base de couplage<\/td>\n<\/tr>\n
Laura Brouilhet<\/td>\nRound-Optimal Constant-Size Blind Signatures<\/td>\n<\/tr>\n
10h35 — 10:45<\/span><\/td>\nBreak 10 minutes<\/td>\n<\/tr>\n
 <\/p>\n
<\/div>\n
<\/div>\n
<\/div>\n
10h45<\/div>\n
—<\/div>\n
11h00<\/div>\n<\/td>\n
C\u00e9line Duguet<\/td>\nZero-knowledge proofs for MLS<\/td>\n<\/tr>\n
Abbass Madi<\/td>\nA secure approach for Neural Networks using Homomorphic Encryption and Verifiable Computation<\/td>\n<\/tr>\n
Florian Caullery<\/td>\nExploring Parallelization Strategies for SPHINCS+<\/td>\n<\/tr>\n
 <\/p>\n
11h00<\/div>\n
—<\/div>\n
11h40<\/div>\n<\/td>\n
Chair: Sihem Mesnager<\/td>\n<\/tr>\n
Simon Abelard<\/td>\nUn algorithme (plus) rapide pour calculer des espaces de Riemann-Roch<\/td>\n<\/tr>\n
Sarah Bordage<\/td>\nInteractive Oracle Proof of Proximity for Products of Reed-Solomon Codes<\/td>\n<\/tr>\n
11h40 — 11:50<\/span><\/td>\nBreak 10 minutes<\/td>\n<\/tr>\n
 <\/p>\n
11h50<\/div>\n
—<\/div>\n
12h30<\/div>\n<\/td>\n
Ilaria Zappatore<\/td>\nEnhancing simultaneous rational function reconstruction with errors: adaptive error correction capability and new bounds for applications<\/td>\n<\/tr>\n
Jade Nardi<\/td>\nExplicit construction and parameters of projective toric codes<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>","protected":false},"excerpt":{"rendered":"

You can download the program in pdf format from here.   Monday November 2nd   9h30 — 10h30 Chair: Vanessa Vitse Jean Kieffer Calcul d\u2019isog\u00e9nies \u00e0 partir d\u2019\u00e9quations modulaires en genre 2 Simon Masson Verifiable Delay Functions from Supersingular Isogenies and Pairings Arthur Lavice Multiplication over extension fields for Pairing-based\u2026<\/p>\n

Continue reading<\/span><\/i><\/a> <\/p>\n","protected":false},"author":1638,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":"","_members_access_role":[],"_members_access_error":""},"class_list":["post-215","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/jc2-2020.inria.fr\/en\/wp-json\/wp\/v2\/pages\/215","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jc2-2020.inria.fr\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/jc2-2020.inria.fr\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/jc2-2020.inria.fr\/en\/wp-json\/wp\/v2\/users\/1638"}],"replies":[{"embeddable":true,"href":"https:\/\/jc2-2020.inria.fr\/en\/wp-json\/wp\/v2\/comments?post=215"}],"version-history":[{"count":23,"href":"https:\/\/jc2-2020.inria.fr\/en\/wp-json\/wp\/v2\/pages\/215\/revisions"}],"predecessor-version":[{"id":242,"href":"https:\/\/jc2-2020.inria.fr\/en\/wp-json\/wp\/v2\/pages\/215\/revisions\/242"}],"wp:attachment":[{"href":"https:\/\/jc2-2020.inria.fr\/en\/wp-json\/wp\/v2\/media?parent=215"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}