We consider the following problem: Given a commitment to a value σ, prove in zero-
knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or …

Abstract k-times anonymous authentication (k-TAA) schemes allow members of a group to
be authenticated anonymously by application providers for a bounded number of times …

In this paper, we introduce P-signatures. A P-signature scheme consists of a signature
scheme, a commitment scheme, and (1) an interactive protocol for obtaining a signature on …

Group signatures are a central cryptographic primitive that has received a considerable
amount of attention from the cryptographic community. They allow members of a group to …

Group signatures are a central cryptographic primitive, simultaneously supporting
accountability and anonymity. They allow users to anonymously sign messages on behalf of …

Lots of revocable group signature schemes have been proposed so far. In one type of
revocable schemes, signing and/or verifying algorithms have O (N) or O (R) complexity …

The lack of privacy in the first generation of cryptocurrencies such as Bitcoin, Ethereum, etc.
is a well known problem in cryptocurrency research. To overcome this problem, several new …

Anonymous authentication (AA) schemes are used by an application provider to grant
services to its n users for pre-defined k times after they have authenticated themselves …

Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many
cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing …

Dynamic k-times anonymous authentication (k-TAA) schemes allow members of a group to
be authenticated anonymously by application providers for a bounded number of times …