UCL Crypto Group | Publications

Search publications by date:
1995 | 1996 | 1997 | 1998 | 1999 | 2000 | 2001 | 2002 | 2003 | 2004
2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014
2015 | 2016 | 2017 | 2018 | Latest | Forthcoming

BibTeX - Year 2014

Publications dated 2014

March 2014

Vincent Grosso, Gaëtan Leurent, François-Xavier Standaert, and Kerem Varici. LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations, In Carlos Cid and Christian Rechberger, editor(s), FSE 2014, Lecture Notes in Computer Science (LNCS), Spinger, March 2014 PDF BibTeX

Benoit Libert, Moti Yung, Marc Joye, and Thomas Peters. Traceable Group Encryption, In H. Krawczyk & A. Waissbein, editor(s), Public-Key Cryptography – PKC 2014, Lecture Notes in Computer Science, Spinger, March 2014 BibTeX

April 2014

Christophe Petit. Rubik's for Cryptographers, In Mathematical Advance in Translation, Volume 33-1, pages 5-13, April 2014, (Chinese translation of AMS Notices, Vol 60 paper) BibTeX

May 2014

Benoit Libert, Thomas Peters, Marc Joye, and Moti Yung. Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures, In P.Q. Nguyen & E. Oswald, editor(s), Eurocrypt 2014, Lecture Notes in Computer Science, Spinger, May 2014 BibTeX

Vincent Grosso, and François-Xavier Standaert. Efficient Masked S-Boxes Processing – A Step Forward –, In D. Pointcheval D. Vergnaud, editor(s), AFRICACRYPT 2014, Lecture Notes in Computer Science, Spinger, May 2014 PDF BibTeX

June 2014

Christophe Petit. Towards factoring in SL(2,2^n), In Designs Codes and Cryptography, Volume 71-3, pages 409-431, June 2014 BibTeX

Christophe Petit, Mathieu Renauld, and François-Xavier Standaert. On a particular case of the bisymmetric equation for quasigroups, In Acta Mathematica Hungarica, June 2014, DOI 10.1007/s10474-014-0428-y BibTeX

July 2014

Timothy Hodges, Christophe Petit, and Jacob Schlather. First fall degree and Weil descent, In Finite Fields and their Applications, July 2014, (to appear) BibTeX

August 2014

Christophe Petit. Finding Roots in GF(p^n) with the Successive Resultant Algorithm, In LMS Journal of Computation and Mathematics, August 2014, (to appear) BibTeX

David Kohel, Kristin Lauter, Christophe Petit, and Jean-Pierre Tignol. On the quaternion $\ell$-isogeny path problem, In LMS Journal of Computation and Mathematics, August 2014, (to appear) BibTeX

November 2014

Josep Balasch, Benedikt Gierlichs, Vincent Grosso, Oscar Reparaz, and François-Xavier Standaert. On the Cost of Lazy Engineering for Masked Software Implementations, CARDIS 2014, Lecture Notes in Computer Science (LNCS), Spinger, November 2014 PDF BibTeX

Vincent Grosso, Romain Poussier, François-Xavier Standaert, and Lubos Gaspar. Combining Leakage-Resilient PRFs and Shuffling, CARDIS 2014, Lecture Notes in Computer Science (LNCS), Springer, November 2014 PDF BibTeX

December 2014

Édouard Cuvelier, and Olivier Pereira. Multi-Party Function Evaluation with Perfectly Private Audit Trail, December 2014 BibTeX

Benoit Libert, Marc Joye, Thomas Peters, and Moti Yung. Concise Multi-Challenge CCA-secure Encryption and Signatures with Almost Tight Security, In Iwata and Sarkar, editor(s), Asiacrypt 2014, Lecture Notes in Computer Science, Spinger, December 2014 BibTeX

Olivier Pereira. Verifiable Elections with Commitment Consistent Encryption - A Primer, In CoRR, December 2014, http://arxiv.org/abs/1412.7358 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.