Encoding efficient attributes using prime modulo method for anonymous credentials

The thesis explains a new method of encoding binary and finite set attributes in the anonymous credential system. To encode each binary and finite set attribute, we used the Chinese remainder theorem instead of using prime numbers [1].We then used the divisibility and coprime properties to efficiently prove the presence and absence of the attributes. The system is built on strong RSA assumptions. The new method can incorporate large numbers of binary and finite set attributes as compared to the Camenisch-Grobeta credential system. Our new method can be used in electronic cards, health insurance cards and also in small devices like smart cards and cell phones.