Back to search

North Dakota State University

Encoding Efficient Attributes Using Prime Modulo Method For Anonymous Credentials

Abstract

dc:description.abstract

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-Groβ 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.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Pattanayak, Sayantica

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/27817

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Pattanayak, Sayantica. Encoding Efficient Attributes Using Prime Modulo Method For Anonymous Credentials. North Dakota State University, 2015. https://hdl.handle.net/10365/27817