ALMASTY - Artigos de Conferencia

Pesquisa
Publicações
Research reports

Current teams : ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL

Publicações ALMASTY	2021	2022	2023	2024	2025	Total
Livros	0	0	1	0	0	1
Livros Editados	0	0	0	0	0	0
Jornais	7	2	2	6	2	19
Capítulos de livros	0	0	0	0	0	0
Artigos de Conferencia	3	5	8	2	1	19
Habilitações (Livre Docência)	0	1	0	0	0	1
Teses	0	0	2	1	1	4

LIP6

J.‑C. Bajard, J. Eynard, A. Hasan, P. Martins, L. Sousa, V. Zucca : “Efficient reductions in cyclotomic rings - Application to Ring-LWE based FHE schemes”, Selected Areas of Cryptography 2017, Ottawa, Canada [Bajard 2017b]
G. Barthe, Th. Espitau, B. Grégoire, J. Hsu, P.‑Y. Strub : “Proving uniformity and independence by self-composition and coupling”, LPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, pp. 19 [Barthe 2017b]
G. Barthe, Th. Espitau, J. Hsu, T. Sato, P.‑Y. Strub : “Liftings for Differential Privacy”, ICALP 2017, Varsovie, Poland [Barthe 2017c]
J.‑F. Biasse, Th. Espitau, P.‑A. Fouque, A. Gélin, P. Kirchner : “Computing generator in cyclotomic integer rings: A subfield algorithm for the Principal Ideal Problem in Ll∆Kl(1/2) and application to cryptanalysis of a FHE scheme”, Advances in Cryptology – EUROCRYPT 2017 36^th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part I, vol. 10210, Lecture Notes in Computer Science, Paris, France, pp. 60-88 [Biasse 2017]
J.‑G. Dumas, V. Zucca : “Prover efficient public verification of dense or sparse/structured matrix-vector multiplication”, ACISP 2017 - 22^nd Australasian Conference on Information Security and Privacy, vol. 10343, Lecture Notes in Computer Science, Auckland, New Zealand, pp. 115-134, (Springer) [Dumas 2017]
Th. Espitau, P.‑A. Fouque, B. Gérard, M. Tibouchi : “Side-Channel Attacks on BLISS Lattice-Based Signatures: Exploiting Branch Tracing against strongSwan and Electromagnetic Emanations in Microcontrollers”, CCS '17 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, United States, pp. 1857-1874, (ACM) [Espitau 2017]
A. Gélin, B. Wesolowski : “Loop-Abort Faults on Supersingular Isogeny Cryptosystems”, Post-Quantum Cryptography - 8^th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 26-28, 2017, Proceedings, vol. 10346, Lecture Notes in Computer Science, Utrecht, Netherlands, pp. 93-106 [Gélin 2017a]
A. Gélin, Th. Kleinjung, Arjen K. Lenstra : “Parametrizations for Families of ECM-Friendly Curves”, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017, Kaiserslautern, Germany, pp. 165-171 [Gélin 2017b]
A. Joux : “Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances”, 34^th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Hanover, Germany [Joux 2017]
Th. Mefenza, D. Vergnaud : “Lattice Attacks on Pairing-Based Signatures”, IMACC 2017: Cryptography and Coding, vol. 10655, Lecture Notes in Computer Science, Oxford, United Kingdom, pp. 352-370, (Springer) [Mefenza 2017]