Accepted Papers

The Ephemeral Pairing Problem
Jaap-Henk Hoepman

Efficient Maximal Privacy in Voting and Anonymous Broadcast
Jens Groth

Practical Anonymity for the Masses with MorphMix
Marc Rennhard and Bernhard Plattner

Call Center Customer Verification by Query-Directed Passwords
Lawrence O’Gorman, Smit Begga, and John Bentley

A Privacy-Friendly Loyalty System Based on Discrete Logarithms over Elliptic Curves
Matthias Enzmann, Marc Fischlin, and Markus Schneider

Identity-based Chameleon Hash and Applications
Giuseppe Ateniese and Breno de Medeiros

Selecting Correlated Random Actions
Vanessa Teague

Addressing Online Dictionary Attacks with Login Histories and Humans-in-the-Loop
S. Stubblebine and P.C. van Oorschot

An Efficient and Usable Multi-Show Non-Transferable Anonymous Credential System
Pino Persiano and Ivan Visconti

Electronic National Lotteries
Elisavet Konstantinou, Vasiliki Liagokou, Paul Spirakis, Yannis C. Stamatiou, and Moti Yung

Mixminion: Strong Anonymity for Financial Cryptography
Nick Matthewson and Roger Dingledine

Interleaving Cryptography and Mechanism Design: The Case of Online Auctions
Edith Elkind and Helger Lipmaa

The Vector-Ballot E-Voting Approach
Aggelos Kiayias and Moti Yung

Microcredits for Verifiable Foreign Service Provider Metering
Craig Gentry and Zulfikar Ramzan

Stopping Timing Attacks in Low-Latency Mix-Based Systems
Brian N. Levine, Michael K. Reiter, and Chenxi Wang

Secure Generalized Vickrey Auction without Third-Party Servers
Makoto Yokoo and Koutarou Suzuki

Provable Unlinkability Against Traffic Analysis
Ron Berman, Amos Fiat, and Amnon Ta-Shma