The utility of anonymous communication is undermined by a growing number of websites
treating users of such services in a degraded fashion. The second-class treatment of …

Verification of a polynomial's evaluation in a secret committed value plays a role in
cryptographic applications such as non-membership or membership proofs. We construct a …

Anonymous authentication can give users the license to misbehave since there is no fear of
retribution. As a deterrent or means to revocation, various schemes for accountable …

Anonymous communications networks, such as Tor, help to solve the real and important
problem of enabling users to communicate privately over the Internet. However, in doing so …

Computations of small discrete logarithms are feasible even in “secure” groups, and are
used as subroutines in several cryptographic protocols in the literature. For example, the …

We present the design, security proof, and implementation of an anonymous subscription
service. Users register for the service by providing some form of identity, which might or …

Some users may misbehave under the cover of anonymity by, eg, defacing webpages on
Wikipedia or posting vulgar comments on YouTube. To prevent such abuse, a few …

With increasing consumer awareness towards information privacy and government-enforced
regulations on data protection, organizations are implementing Privacy Enhancing …

An alibi provides evidence of a person's past location and can be critical in proving ones
innocence. An alibi involves two parties: the owner, who benefits from the alibi, and the …

The negation map can be used to speed up the computation of elliptic curve discrete
logarithms using either the baby-step giant-step algorithm (BSGS) or Pollard rho …