Follow
Fabien Laguillaumie
Fabien Laguillaumie
Professeur of Computer Science, Univ. Montpellier/LIRMM
Verified email at ens-lyon.fr - Homepage
Title
Cited by
Cited by
Year
Constant size ciphertexts in threshold attribute-based encryption
J Herranz, F Laguillaumie, C RÓfols
International Workshop on Public Key Cryptography, 19-34, 2010
3102010
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
2332012
Designated Verifier Signatures: Anonymity and Efficient Construction from Any Bilinear Map
F Laguillaumie, D Vergnaud
International Conference on Security in Communication Networks, 105-119, 2004
1912004
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
1642013
Short attribute-based signatures for threshold predicates
J Herranz, F Laguillaumie, B Libert, C Rafols
Cryptographers’ Track at the RSA Conference, 51-67, 2012
1622012
Multi-designated verifiers signatures
F Laguillaumie, D Vergnaud
International Conference on Information and Communications Security, 495-507, 2004
1422004
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
1322011
Linearly Homomorphic Encryption from
G Castagnos, F Laguillaumie
Cryptographers’ Track at the RSA Conference, 487-505, 2015
682015
Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
C Chevalier, F Laguillaumie, D Vergnaud
Algorithmica 83 (1), 72-115, 2021
572021
Trapdoor sanitizable signatures and their application to content protection
S Canard, F Laguillaumie, M Milhau
International Conference on Applied Cryptography and Network Security, 258-276, 2008
532008
Universal designated verifier signatures without random oracles or non-black box assumptions
F Laguillaumie, B Libert, JJ Quisquater
International Conference on Security and Cryptography for Networks, 63-77, 2006
532006
Plaintext-checkable encryption
S Canard, G Fuchsbauer, A Gouget, F Laguillaumie
Cryptographers’ track at the RSA conference, 332-348, 2012
482012
Multi-designated verifiers signatures: anonymity without encryption
F Laguillaumie, D Vergnaud
Information Processing Letters 102 (2-3), 127-132, 2007
482007
Two-party ECDSA from hash proof systems and efficient instantiations
G Castagnos, D Catalano, F Laguillaumie, F Savasta, I Tucker
Annual International Cryptology Conference, 191-221, 2019
462019
Universally convertible directed signatures
F Laguillaumie, P Paillier, D Vergnaud
International Conference on the Theory and Application of Cryptology andá…, 2005
462005
Short undeniable signatures without random oracles: The missing link
F Laguillaumie, D Vergnaud
International Conference on Cryptology in India, 283-296, 2005
422005
Time-selective convertible undeniable signatures
F Laguillaumie, D Vergnaud
Cryptographers’ Track at the RSA Conference, 154-171, 2005
392005
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
372020
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
372015
Blind ring signatures secure under the chosen-target-CDH assumption
J Herranz, F Laguillaumie
International Conference on Information Security, 117-130, 2006
372006
The system can't perform the operation now. Try again later.
Articles 1–20