Efficient proofs of attributes in pairing-based anonymous credential system

Amang Sudarsono, Toru Nakanishi, Nobuo Funabiki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

38 Citations (Scopus)

Abstract

An anonymous credential system allows the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. One of the applications is the privacy-enhancing electronic ID (eID). A previously proposed anonymous credential system achieves constant complexity in the number of finite-set attributes of the user. However, the system is based on the RSA. In this paper, we show how to achieve the constant complexity in a pairing-based anonymous credential system excluding the RSA. The key idea of the construction is the use of a pairing-based accumulator. The accumulator outputs a constant-size value from a large set of input values. Using zero-knowledge proofs of pairing-based certificates and accumulators, we can prove AND and OR relations with constant complexity in the number of finite-set attributes.

Original languageEnglish
Title of host publicationPrivacy Enhancing Technologies - 11th International Symposium, PETS 2011, Proceedings
PublisherSpringer Verlag
Pages246-263
Number of pages18
ISBN (Print)9783642222627
DOIs
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6794 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient proofs of attributes in pairing-based anonymous credential system'. Together they form a unique fingerprint.

Cite this