Cryptography, secret writing, is enjoying a scientific renaissance following the seminal
discovery in 1977 of public-key cryptography and applications in computers and …

A vast number of e-voting schemes including mix-net-based e-voting, homomorphic e-
voting, blind signature-based e-voting, blockchain-based e-voting, post-quantum e-voting …

In this paper we present a new multi‐authority secret‐ballot election scheme that guarantees
privacy, universal veriability, and robustness. It is the first scheme for which the performance …

We present a linkable spontaneously anonymous group (LSAG) signature scheme
(alternatively known as linkable ring signature scheme) satisfying the following three …

We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …

Voting schemes that provide receipt-freeness prevent voters from proving their cast vote,
and hence thwart vote-buying and coercion. We analyze the security of the multi-authority …

We introduce a new cryptographic technique that we call universal re-encryption. A
conventional cryptosystem that permits re-encryption, such as ElGamal, does so only for a …

Strong voter privacy, although an important property of an election scheme, is usually
compromised in election protocol design in favor of other (desirable) properties. In this work …

Much work has been done in recent decades to apply sophisticated cryptographic
techniques to achieve strong end-to-end verifiability in election protocols. The properties of …

We discuss problems and trade-offs with systems providing anonymity for web browsing (or
more generally any communication system that requires low latency interaction). We focus …