| Constant size ciphertexts in threshold attribute-based encryption J Herranz, F Laguillaumie, C Ràfols International Workshop on Public Key Cryptography, 19-34, 2010 | 349 | 2010 |
| Attribute-based encryption schemes with constant-size ciphertexts N Attrapadung, J Herranz, F Laguillaumie, B Libert, E De Panafieu, ... Theoretical computer science 422, 15-38, 2012 | 253 | 2012 |
| Designated Verifier Signatures: Anonymity and Efficient Construction from Any Bilinear Map F Laguillaumie, D Vergnaud Security in Communication Networks: 4th International Conference, SCN 2004 …, 2005 | 209 | 2005 |
| Lattice-based group signatures with logarithmic signature size F Laguillaumie, A Langlois, B Libert, D Stehlé International conference on the theory and application of cryptology and …, 2013 | 191 | 2013 |
| Short attribute-based signatures for threshold predicates J Herranz, F Laguillaumie, B Libert, C Rafols Cryptographers’ track at the RSA conference, 51-67, 2012 | 178 | 2012 |
| A new efficient threshold ring signature scheme based on coding theory CA Melchor, PL Cayrel, P Gaborit, F Laguillaumie IEEE Transactions on Information Theory 57 (7), 4833-4842, 2011 | 156 | 2011 |
| Multi-designated verifiers signatures F Laguillaumie, D Vergnaud Information and Communications Security: 6th International Conference, ICICS …, 2004 | 155 | 2004 |
| Linearly homomorphic encryption from G Castagnos, F Laguillaumie Cryptographers’ Track at the RSA Conference, 487-505, 2015 | 137 | 2015 |
| Bandwidth-efficient threshold EC-DSA G Castagnos, D Catalano, F Laguillaumie, F Savasta, I Tucker IACR International Conference on Public-Key Cryptography, 266-296, 2020 | 115 | 2020 |
| Two-party ECDSA from hash proof systems and efficient instantiations G Castagnos, D Catalano, F Laguillaumie, F Savasta, I Tucker Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019 | 98 | 2019 |
| Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p G Castagnos, F Laguillaumie, I Tucker International Conference on the Theory and Application of Cryptology and …, 2018 | 80 | 2018 |
| Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions C Chevalier, F Laguillaumie, D Vergnaud Algorithmica 83 (1), 72-115, 2021 | 60 | 2021 |
| Plaintext-checkable encryption S Canard, G Fuchsbauer, A Gouget, F Laguillaumie Topics in Cryptology–CT-RSA 2012: The Cryptographers’ Track at the RSA …, 2012 | 59 | 2012 |
| Trapdoor Sanitizable Signatures and Their Application to Content Protection S Canard, F Laguillaumie, M Milhau Applied Cryptography and Network Security: 6th International Conference …, 2008 | 59 | 2008 |
| Multi-designated verifiers signatures: anonymity without encryption F Laguillaumie, D Vergnaud Information Processing Letters 102 (2-3), 127-132, 2007 | 59 | 2007 |
| Universal designated verifier signatures without random oracles or non-black box assumptions F Laguillaumie, B Libert, JJ Quisquater Security and Cryptography for Networks: 5th International Conference, SCN …, 2006 | 57 | 2006 |
| Universally convertible directed signatures F Laguillaumie, P Paillier, D Vergnaud International Conference on the Theory and Application of Cryptology and …, 2005 | 49 | 2005 |
| Implementing candidate graded encoding schemes from ideal lattices MR Albrecht, C Cocis, F Laguillaumie, A Langlois International Conference on the Theory and Application of Cryptology and …, 2015 | 45 | 2015 |
| Short undeniable signatures without random oracles: The missing link F Laguillaumie, D Vergnaud International Conference on Cryptology in India, 283-296, 2005 | 44 | 2005 |
| Efficient CCA timed commitments in class groups SAK Thyagarajan, G Castagnos, F Laguillaumie, G Malavolta Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021 | 41 | 2021 |
Damien VergnaudSorbonne Universitélip6.fr의 이메일 확인됨
