Associated with Financial Crypto & Data Security 2013

Homomorphic Cryptography has become one of hottest topics in mathematics and computer science since Gentry presented the first fully homomorphic scheme in 2009. Several similar, as well as a number of limited schemes have been proposed, creating a diverse mathematical basis for further theoretical research. Research on practical applications of homomorphic encryption is still less advanced due to the poor performance resulting on the complexity assumptions made in current encryption schemes. Recent research results in the area show that homomorphic encryption can be used or embedded in applications of practical relevance.
The goal of the WAHC is to bring together professionals, researchers and practitioners in the area of computer security and applied cryptography with an interest in practical applications of homomorphic encryption (but also secure function evaluation, private information retrieval or searchable encryption) to present, discuss, and share the latest findings in the field, and to exchange ideas that address real-world problems with practical solutions using homomorphic cryptography.

Topics include (but are not limited to)

- implementation issues of homomorphic encryption schemes
- practical performance evaluation of homomorphic encryption schemes
- software architectures for encrypted applications
- platforms and system integration for encrypted applications
- algorithmic primitives for encrypted applications
- encrypted search schemes
- encrypted applications in bio-informatics
- encrypted e-payment solutions
- encrypted financial transactions
- hybrid (partly encrypted) applications

All accepted papers will be published in an LNCS volume (as part of the main FC '13 proceedings or collected in a subsidiary workshop proceedings). Submissions are limited to 12 pages including references and appendices. Authors are invited to submit anonymous versions of their papers for initial review via EasyChair. Referees will do their best to avoid identification of authors of anonymous papers during the review process.

Keynotes:

Vinod Vaikuntanathan, University of Toronto
Zvika Brakerski, Stanford University

Organising Committee:

Michael Brenner and Matthew Smith
Distributed Computing & Security Group Leibniz Universitaet Hannover, Germany

Program Committee:

Jose Maria Alcaraz Calero, HP Labs, UK
Lynn Batten, Deakin University, Australia
Zvika Brakerski, Stanford University, USA
Kristin Lauter, Microsoft, USA
Aggelos Kiayias, University of Connecticut, USA
Vladimir Kolesnikov, Bell Labs, USA
David Naccache, Ecole Normale Superieure, Paris, France
Maire O'Neill, Queen's University Belfast, UK
Elizabeth O'Sullivan, Queen's University Belfast, UK
Henning Perl, Universitaet Hannover, Germany
Benny Pinkas, Bar Ilan University, Israel
Kurt Rohloff, BBN Technologies, USA
Christoph Sorge, Universitaet Paderborn, Germany
Osman Ugus, Hochschule für Angewandte Wissenschaften (HAW) Hamburg, Germany
Yevgeniy Vahlis, AT&T Labs, USA
Vinod Vaikuntanathan, University of Toronto, Canada
Marten VanDijk, MIT CSAIL, USA
Fre Vercauteren, Katholieke Universiteit Leuven, Belgium
Adrian Waller, Thales, UK
Dirk Westhoff, Hochschule Furtwangen University, Germany
Xun Yi, Victoria University, Melbourne, Australia