PolSys - Artigos de Conferencia

Equipes atuais :	ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MLIA MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL Whisper
Antigos grupos :	AnimatLab MALIRE REGAL SALSA SPI SPIRAL
Antigos tópicos de pesquisa :	ANP APA ASIM CALFOR OASIS RP SPI SRC SYSDEF

Publicações PolSys	2015	2016	2017	2018	2019	2020	Total
Livros	0	0	0	0	0	0	0
Livros Editados	0	0	0	0	0	1	1
Jornais	4	10	8	10	8	11	51
Capítulos de livros	1	1	0	0	0	0	2
Artigos de Conferencia	10	15	6	10	7	2	50
Habilitações (Livre Docência)	0	2	0	0	0	0	2
Teses	2	2	1	0	1	0	6

A. Bauer, H. Gilbert, G. Renault, M. Rossi : “Assessment of the Key-Reuse Resilience of NewHope”, CT-RSA 2019 - The Cryptographers' Track at the RSA Conference, vol. 11405, Lecture Notes in Computer Science, San Francisco, United States, pp. 272-292, (Springer) [Bauer 2019]
M. Bender, J.‑Ch. Faugère, E. Tsigaridas : “Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems”, ISSAC 2019 - 44^th International Symposium on Symbolic and Algebraic Computation, Beijing, China, pp. 42-49, (ACM) [Bender 2019a]
J.‑Ch. Faugère, L. Perret, J. Ryckeghem : “Software Toolkit for HFE-based Multivariate Schemes”, CHES 2019 : International Conference on Cryptographic Hardware and Embedded Systems, vol. 2019 (3), IACR Transactions on Cryptographic Hardware and Embedded Systems, Atlanta, United States, pp. 257-304 [Faugère 2019b]
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 - 17^th International Conference on Theory of Cryptography, vol. 11892, Lecture Notes in Computer Science, Nuremberg, Germany, pp. 386-406, (Springer) [Kushilevitz 2019]
P. Lairez, M. Mezzarobba, M. Safey El Din : “Computing the volume of compact semi-algebraic sets”, ISSAC'19, Beijing, China, (ACM) [Lairez 2019]