| On the hardness of the Mersenne low Hamming ratio assumption M Beunardeau, A Connolly, R Géraud, D Naccache Progress in Cryptology–LATINCRYPT 2017: 5th International Conference on …, 2019 | 38 | 2019 |
| Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes A Connolly, P Lafourcade, O Perez Kempner IACR International Conference on Public-Key Cryptography, 409-438, 2022 | 30 | 2022 |
| White-box cryptography: Security in an insecure environment M Beunardeau, A Connolly, R Geraud, D Naccache IEEE Security & Privacy 14 (5), 88-92, 2016 | 29 | 2016 |
| Fully homomorphic encryption: Computations with a blindfold M Beunardeau, A Connolly, R Geraud, D Naccache IEEE Security & Privacy 14 (1), 63-67, 2016 | 19 | 2016 |
| From clustering supersequences to entropy minimizing subsequences for single and double deletions A Atashpendar, M Beunardeau, A Connolly, R Géraud, D Mestel, ... arXiv preprint arXiv:1802.00703, 2018 | 13 | 2018 |
| Freedom of encryption A Connolly IEEE Security & Privacy 16 (1), 102-103, 2018 | 9 | 2018 |
| Cdoe obofsucaitn: Securing software from within M Beunardeau, A Connolly, R Geraud, D Naccache IEEE Security & Privacy 14 (3), 78-81, 2016 | 7 | 2016 |
| Protego: Efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric A Connolly, J Deschamps, P Lafourcade, O Perez Kempner International Conference on Cryptology in India, 249-271, 2022 | 6* | 2022 |
| Optimal Covid-19 pool testing with a priori information M Beunardeau, É Brier, N Cartier, A Connolly, N Courant, ... arXiv preprint arXiv:2005.02940, 2020 | 5 | 2020 |
| The case for system command encryption M Beunardeau, A Connolly, R Geraud, D Naccache Proceedings of the 2017 ACM on Asia Conference on Computer and …, 2017 | 5 | 2017 |
| Reusing Nonces in Schnorr Signatures: (and Keeping It Secure...) M Beunardeau, A Connolly, H Ferradi, R Géraud, D Naccache, ... Computer Security–ESORICS 2017: 22nd European Symposium on Research in …, 2017 | 5 | 2017 |
| vetkeys: How a blockchain can keep many secrets A Cerulli, A Connolly, G Neven, FS Preiss, V Shoup Cryptology ePrint Archive, 2023 | 4 | 2023 |
| Security of symmetric primitives against key-correlated attacks A Connolly, P Farshim, G Fuchsbauer IACR Transactions on Symmetric Cryptology, 193-230, 2019 | 2 | 2019 |
| Transaction authentication method, server and system using two communication channels D Naccache, M Beunardeau, A Connolly, R Geraud, H Koudoussi US Patent App. 17/784,861, 2023 | 1 | 2023 |
| Method of encryption, method of decryption, corresponding computer device and program M Beunardeau, R Geraud, D Naccache, A Connolly US Patent 11,075,756, 2021 | | 2021 |
| Try again. Fail again. Fail better: new notions of security, broken assumptions, and increased efficiency in cryptography A Connolly Paris Sciences et Lettres (ComUE), 2019 | | 2019 |
Rémi Geraud-StewartÉcole normale supérieure (Paris)Verified email at ens.fr
