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 | Latest | Forthcoming

BibTeX - Year 2013

Latest publications

April 2013

Édouard Cuvelier, Sophie Mawet, Olivier Pereira, Abdelrahaman Aly, and Mathieu Vanvyve. Securly Solving Simple Combinatorial Graph Problems, Financial Cryptography and Data Security 2013, April 2013 BibTeX

February 2013

Nuttapong Attrapadung, Benoit Libert, and Thomas Peters. Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures, In K. Kurosawa & G. Hanaoka, editor(s), Public-Key Cryptography – PKC 2013, Volume 7778 of Lecture Notes in Computer Science, Spinger, February 2013 BibTeX

December 2012

Luca Calderoni, Dario Maio, and Paolo Palmieri. Location-aware Mobile Services for a Smart City: Design, Implementation and Deployment, In Journal of Theoretical and Applied Electronic Commerce Research, Volume 7-3, pages 74-87, December 2012, Special Issue on Smart Applications for Smart Cities - New Approaches to Innovation PDF BibTeX

Nuttapong Attrapadung, Benoit Libert, and Thomas Peters. Computing on Authenticated Data: New Privacy Definitions and Constructions, In X. Wang & K. Sako, editor(s), Asiacrypt 2012, Volume 7658 of Lecture Notes on Computer Science, pages 367-385 , Springer, December 2012 BibTeX

Christophe Petit, and Jean-Jacques Quisquater. On polynomial systems arising from a Weil descent, Asiacrypt 2012, Lecture Notes in Computer Science (LNCS), Springer, December 2012 PDF BibTeX

David Bernhard, Olivier Pereira, and Bogdan Warinschi. How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios, In X. Wang and K. Sako, editor(s), ASIACRYPT 2012, Volume 7658 of Lecture Notes in Computer Science, pages 626--643, Springer, December 2012 PDF BibTeX

November 2012

Josh Benaloh, Mike Byrne, Philip Kortum, Neal McBurnett, Olivier Pereira, Philip Stark, and Dan Wallach. STAR-Vote: A Secure, Transparent, Auditable, and Reliable Voting System, arXiv.org:1211.1904, November 2012 PDF BibTeX

October 2012

David Bernhard, Veronique Cortier, Olivier Pereira, and Bogdan Warinschi. Measuring vote privacy, revisited, In Ting Yu and George Danezis and Virgil D. Gligor, editor(s), ACM Conference on Computer and Communications Security, pages 941-952, ACM, October 2012 PDF BibTeX

September 2012

Christophe Petit. Towards factoring in SL(2,2^n), In Designs Codes and Cryptography, September 2012 BibTeX

Timothy Hodges, Christophe Petit, and Jacob Schlather. Degree of Regularity for Systems arising from Weil Descent, YAC2012 - Yet Another Conference in Cryptography, September 2012 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.