Fabien Laguillaumie
Publications



International Journals
  1. Multi-Designated Verifiers Signatures: Anonymity without Encryption. F. Laguillaumie, D. Vergnaud. Information Processing Letters, Volume 102, Issues 2-3, 30 April 2007, 127-132 (2007) [ps.gz] 

  2. Aggregate Designated Verifier Signatures and Application to Secure Routing. R. Bhaskar, J. Herranz and F. Laguillaumie. International Journal of Security and Networks, Special Issue on Cryptography in Networks, Vol. 1 (1/2/3) (2007)

  3. Universal Forgery on Sekhar's Signature Scheme with Message Recovery. F. Laguillaumie, J. Traoré, D. Vergnaud. Taylor & Francis - International Journal of Computer Mathematics, Vol. 81 (12), 1493-1495 (2004) [ps.gz]


International Conferences
  1. Trapdoor Sanitizable Signatures and their Application to Content Protection. S. Canard, F. Laguillaumie, M. Milhau. Proc. of ACNS'08. Springer LNCS Vol. 5037, 256-276 (2008) Copyright Springer [ .pdf] 

  2. On the Soundness of Restricted Universal Designated Signatures and Dedicated Signatures - How to prove the possession of an Elgamal/DSA signature. F. Laguillaumie, D. Vergnaud. Proc. of ISC'07. Springer LNCS Vol. 4779, 175-188 (2007) Copyright Springer [ ps.gz] 

  3. Blind Ring Signatures Secure under the Chosen Target CDH Assumption. J. Herranz, F. Laguillaumie. Proc. of ISC'06. Springer LNCS Vol. 4176, 117-130 (2006) Copyright Springer [ps.gz]

  4. Efficient Authentication for Reactive Routing Protocols. R. Bhaskar, J. Herranz, F. Laguillaumie. Proc. of AINA'06 (SNDS'06), Vol. II, IEEE Computer Society, 57-61 (2006) [ps.gz]

  5. Universal Designated Verifier Signatures Without Random Oracles or Non Black Box Assumptions. F. Laguillaumie, B. Libert, J.-J. Quisquater. Proc. of SCN'06. Springer LNCS Vol. 4116, 63-77 (2006) Copyright Springer [ps.gz]

  6. Short Undeniable Signatures Without Random Oracles: the Missing Link. F. Laguillaumie, D. Vergnaud. Proc. of Indocrypt'05. Springer LNCS Vol. 3797, 283-296 (2005). Copyright Springer [ps.gz]

  7. Universally Convertible Directed Signatures. F. Laguillaumie, P. Paillier, D. Vergnaud. Proc. of Asiacrypt'05. Springer LNCS Vol. 3788, 682-701 (2005). Copyright IACR [ps.gz]

  8. Time-Selective Convertible Undeniable Signatures. F. Laguillaumie, D. Vergnaud. Proc. of CT-RSA'05. Springer LNCS Vol. 3376, 154-171 (2005). Copyright Springer [ps.gz]

  9. Designated Verifiers Signature: Anonymity and Efficient Construction from any Bilinear Map. F. Laguillaumie, D. Vergnaud. Proc. of SCN'04, Springer LNCS Vol. 3352, 107-121 (2005). Copyright Springer [ps.gz]

  10. Multi-Designated Verifiers Signature Schemes. F. Laguillaumie, D. Vergnaud. Proc. of ICICS'04, Springer LNCS Vol. 3269, 495-507 (2004) Copyright Springer [ps.gz]

  11. Extending the Boneh-Durfee-de Weger attack to RSA-like Cryptosystems. F. Laguillaumie, D. Vergnaud. Proc. of the 24 th Symposium on Information Theory in the Benelux, 45--52 (2003)

Technical Reports:
  1. Efficient and Provably Secure Designated Verifier Signature Schemes from Bilinear Maps. F. Laguillaumie, D. Vergnaud. Rapport de recherche LMNO n° 24 (2003)

  2. Short Private Exponent Attacks on Fast Variants of RSA. M. Ciet, F. Koeune, F. Laguillaumie, J.-J. Quisquater : Technical Report CG-2002/4, UCL Crypto Group, Louvain-la-Neuve (2002)[pdf]


Talks:

PhD thesis: On the security of pairing-based signatures with controlled verification (in french [ps.gz])

I did my PhD thesis under the supervision of Prof. E. Reyssat at the LMNO (Université de Caen) and at France Telecom Research and Development . I defended my PhD on the 29th of June, 2005. The referees were

Abstract : To answer to the increasing needs to secure communication systems, cryptology must provide specific, flexible and efficient solutions. Crucial is the need for authentication.

In this thesis, we analyse cryptographic primitives related to data authentication. They differ from traditional digital signatures as they can only be verified under the control of a specific entity and they provide some anonymity properties.

We first deal with undeniable signatures and introduce a new property in their definition, namely the time-selective conversion. We analyze the security of several new schemes in the random oracle model, and we propose simple undeniable signatures whose security can be proven in the standard model. We also study a logical extension of undeniable signatures, called directed signatures and we propose a new scheme and its security in the random oracle model. Finally we develop the concept of designated verifier signatures and provide a formal definition of  multi-designated verifiers signatures with a rigorous treatment of the security model for such an extension. We also study an anonymity property for the signer.

The signatures presented in this thesis are based on the Weil and Tate pairings, recently introduced in cryptology. These bilinear applications allow a degree of freedom to design cryptosystems, and imply the bilinear variants of the classical Diffie-Hellman problem upon which rely our new schemes. In particular we introduce from simple observations the so-called ``$xyz$-trick'' and the ``$xyz$-DDH'' problem which make it possible to design cryptographic protocols achieving a trade-off between authenticity and privacy.