Disclaimer: This page refers to former member of the group. Validity or accuracy of the following information is thus not guaranteed in any way.
I've made my PhD in Orange Labs at Caen. My main topic was the private authentication in the RFID world. More precisely, I was interested in the devlopment of a security model and the conception of new private and efficient authentication protocol.
Now, I work in the Crypto Group of the UCL. I still work on RFID but also for the SEE project. This latter concerns the Belgium eID card and its applications.
Address: | Microelectronics Laboratory, Place du Levant, 3 |
Office: | b.127.20 |
Voice: | +32 (0) 10 47 81 39 |
Fax: | +32 (0) 10 47 25 98 |
Seminars given
October 22, 2009 - Server-Aided Cryptography for Anonymity
by Dr. Iwen Coisel
Abstract: | Portable devices (mobile phones, smart cards, ...) are very useful to access services from anywhere. However, when authentication protocols require complex cryptography, implying costly mathematical operations, these devices may become inadequate because of their limited capabilities. This is in particular the case when the device must remain anonymous and unlinkable w.r.t. the service provider since it implies the use of complex cryptographic tools. In this presentation, I introduce the concept of server-aided cryptography for anonymity by adding a powerful intermediary which helps the restricted device in its cryptographic computations. I first give a general server-aided model in this setting, which model can be applied to several cryptographic tools: group, blind and ring signatures. I present the server-aided protocol for the zero-knowledge proof of knowledge of a generic discrete logarithms relations set. Then, I expose the best secure and efficient server-aided variants of several well-known constructions |
Publications
Sébastien Canard, Iwen Coisel, Julien Devigne, Cécilia Gallais, Thomas Peters, and Olivier Sanders. Toward Generic Method for Server-Aided Cryptography, In S. Qing & J. Zhou, editor(s), International Conference on Information and Communications Security - ICICS 2013, Lecture Notes in Computer Science, Springer, November 2013 BibTeX
Sébastien Canard, Iwen Coisel, Giacomo de Meulenaer, and Olivier Pereira. Group Signatures are Suitable for Constrained Devices, ICISC 2010, Lecture Notes in Computer Science (LNCS), Springer, December 2010 PDF BibTeX
Sébastien Canard, Iwen Coisel, Jonathan Etrog, and Marc Girault. Privacy-Preserving RFID Systems: Model and Constructions, In Cryptology ePrint Archive, July 2010 PDF BibTeX
Sébastien Canard, Iwen Coisel, and Marc Girault. Security of Privacy-Preserving RFID Systems, IEEE International Conference on RFID-Technology and Applications -- RFID-TA'10, pages 269--274, IEEE, June 2010 BibTeX
Gildas Avoine, Iwen Coisel, and Tania Martin. Time Measurement Threatens Privacy-Friendly RFID Authentication Protocols, In S.B. Ors Yalcin, editor(s), Workshop on RFID Security -- RFIDSec'10, Volume 6370 of Lecture Notes in Computer Science (LNCS), pages 138--157, Spinger, June 2010 PDF BibTeX
Sébastien Canard, Iwen Coisel, and Jonathan Etrog. Lighten Encryption Schemes for Secure and Private RFID Systems, In Radu Sion, Reza Curtmola, Sven Dietrich, Aggelos Kiayias, Josep M. Miret, Kazue Sako, Francesc Sebé, editor(s), Financial Cryptography Workshops, Volume 6054 of Lecture Notes in Computer Science (LNCS), pages 19 - 33, Spinger, January 2010 PDF BibTeX
Sébastien Canard, and Iwen Coisel. Data Synchronization in Privacy-Preserving RFID Authentication Schemes, Workshop on RFID Security -- RFIDSec'08, July 2008 PDF BibTeX
Iwen Coisel, Sébastien Canard, and Jacques Traoré. Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use, In Willy Susilo, Joseph K. Liu, Yi Mu, editor(s), ProvSec, Volume 4784 of Lecture Notes in Computer Science (LNCS), pages 122 - 137, Springer, November 2007 PDF BibTeX
Copyright Notice
(
click here to expand/retract)
Some material that is available from this page is copyrighted.
IACR Copyright Notice: Permission is granted for a user to display all
material at this site, to copy the material onto a single computer, and to make
print copies of the material for personal use only. All other rights are
retained by the International Association for Cryptologic Research. In
particular, any other copying, other redistribution, or any commercial use of
the material requires the permission of the publisher, which may be requested
by contacting the International Association for Cryptologic Research.
IEEE Copyright Notice: This material is presented to ensure timely
dissemination of scholarly and technical work. Copyright and all rights therein
are retained by authors or by other copyright holders. All persons copying this
information are expected to adhere to the terms and constraints invoked by each
author's copyright. In most cases, these works may not be reposted without the
explicit permission of the copyright holder.
ACM Copyright Notice: Copyright © 1999 by the Association for
Computing Machinery, Inc. Permission to make digital or hard copies of part of
this work for personal or classroom use is granted without fee provided that
copies are not made or distributed for profit or commercial advantage and that
copies bear this notice and the full citation on the first page or intial
screen of the document. Copyrights for components of this work owned by others
than ACM must be honored. Abstracting with credit is permitted. To copy
otherwise, to republish, to post on servers, or to redistribute to lists,
requires prior specific permission and/or a fee. Request permissions from
Publications Dept., ACM Inc., fax +1 (212) 869-0481, or
permissions@acm.org.
Springer-Verlag LNCS Copyright Notice: The copyright of these
contributions has been transferred to Springer-Verlag Berlin Heidelberg New
York. The copyright transfer covers the exclusive right to reproduce and
distribute the contribution, including reprints, translations, photographic
reproductions, microform, electronic form (offline, online), or any other
reproductions of similar nature. Online available from Springer-Verlag LNCS
series.