Equipe : ALMASTY - ALgorithms for coMmunicAtion SecuriTY
Axes : SSR (👥👥), TMC (👥👥).Chefe de Equipe :
Damien Vergnaud Campus Pierre et Marie Curie 24-25/412
Curta apresentação
L'équipe Almasty travaille sur les problèmes algorithmiques difficiles liés à la cryptographie et à la sécurité des communications.
Não há eventos planejados no momento.
ArquivosSelected publications
- C. Chevalier, F. Laguillaumie, D. Vergnaud : “Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions”Algorithmica, vol. 83 (1), pp. 72-115, (Springer Verlag)[Chevalier 2021]
- A. Narayanan, M. Weidner : “On Decoding Cohen-Haeupler-Schulman Tree Codes”ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, United States, pp. 1337-1356, (Society for Industrial and Applied Mathematics)[Narayanan 2020]
- E. Kushilevitz, R. Ostrovsky, E. Prouff, A. Rosén, A. Thillard, D. Vergnaud : “Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND”TCC 2019 - 17th International Conference on Theory of Cryptography, vol. 11892, Lecture Notes in Computer Science, Nuremberg, Germany, pp. 386-406, (Springer)[Kushilevitz 2019]
- P. Martins, J. Marrez, J.‑C. Bajard, L. Sousa : “HyPoRes: An Hybrid Representation System for ECC”2019 IEEE 26th Symposium on Computer Arithmetic (ARITH), Kyoto, Japan, pp. 207-214, (IEEE)[Martins 2019]
- Th. Espitau, P.‑A. Fouque, B. Gérard, M. Tibouchi : “Loop-Abort Faults on Lattice-Based Signatures and Key Exchange Protocols”IEEE Transactions on Computers, vol. 67 (11), pp. 1535-1549, (Institute of Electrical and Electronics Engineers)[Espitau 2018]
- G. Barthe, S. Belaid, Th. Espitau, P.‑A. Fouque, B. Grégoire, M. Rossi, M. Tibouchi : “Masking the GLP Lattice-Based Signature Scheme at Any Order”Eurocrypt 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 10821, Lecture Notes in Computer Science, Tel Aviv, Israel, pp. 354-384, (Springer)[Barthe 2018a]
- 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 36th 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]
- 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, 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”34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Hanover, Germany[Joux 2017]