We consider mobile applications that let users learn traffic conditions based on reports from
other users. However, the providers of these mobile services have access to such sensitive …

Modern electronic voting systems (e-voting systems) are designed to achieve a variety of
security properties, such as verifiability, accountability, and vote privacy. Some of these …

A common primitive in election and auction protocols is a plaintext equivalence test (PET) in
which two ciphertexts are tested for equality of their plaintexts, and a verifiable proof of the …

We present a survey on electronic voting schemes. We first summarize properties than such
protocols should guarantee. In a second time we describe cryptographic primitives used in …

We study ballot independence for election schemes: We formally define ballot
independence as a cryptographic game and prove that ballot secrecy implies ballot …

We explore formal definitions of coercion resistance (WPES'05, FC'09, CRYPTO'10, and
CSF'10), conceived to capture the strongest privacy notions achievable by voting systems …

We propose a definition of ballot secrecy as an indistinguishability game in the
computational model of cryptography. Our definition improves upon earlier definitions to …

Voting technology and procedures evolved throughout the history of mankind-from clay balls
put in clay pots in ancient Greek, over paper ballots in the arising democratic societies, to the …

Despite attractive theoretical properties, Vickrey auctions are seldom used due to the risk of
information revelation and fear of cheating. CVAs (Cryptographic Vickrey Auctions) have …

We propose a definition of ballot secrecy in the computational model of cryptography. The
definition builds upon and strengthens earlier definitions by Bernhard et al.(ASIACRYPT'12 …