Anonymous credential system with efficient proofs for monotone formulas on attributes

Shahidatul Sadiah, Toru Nakanishi, Nobuo Funabiki

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

4 Citations (Scopus)

Abstract

An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, a system to prove AND and OR relations simultaneously by CNF formulas was proposed. To achieve a constant-size proof of the formula, this system adopts an accumulator that compresses multiple attributes into a single value. However, this system has a problem: the proof generation requires a large computational time in case of lots of OR literals in the formula. One of the example formulas consists of lots of birthdate attributes to prove age. This greatly increases the public parameters correspondent to attributes, which causes a large delay in the accumulator computation due to multiplications of lots of parameters. In this paper, we propose an anonymous credential system with constant-size proofs for monotone formulas on attributes, in order to obtain more efficiency in the proof generation. The monotone formula is a logic formula that contains any combination of AND and OR relations. Our approach to prove the monotone formula is that the accumulator is extended to be adapted to the tree expressing the monotone formula. Since the use of monotone formulas increases the expression capability of the attribute proof, the number of public parameters multiplied in the accumulator is greatly decreased, which impacts the reduction of the proof generation time.

Original languageEnglish
Title of host publicationAdvances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings
EditorsKeisuke Tanaka, Yuji Suga
PublisherSpringer Verlag
Pages262-278
Number of pages17
ISBN (Print)9783319224244
DOIs
Publication statusPublished - Jan 1 2015
Event10th International Workshop on Security, IWSEC 2015 - Nara, Japan
Duration: Aug 26 2015Aug 28 2015

Publication series

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

Other

Other10th International Workshop on Security, IWSEC 2015
CountryJapan
CityNara
Period8/26/158/28/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Anonymous credential system with efficient proofs for monotone formulas on attributes'. Together they form a unique fingerprint.

  • Cite this

    Sadiah, S., Nakanishi, T., & Funabiki, N. (2015). Anonymous credential system with efficient proofs for monotone formulas on attributes. In K. Tanaka, & Y. Suga (Eds.), Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings (pp. 262-278). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9241). Springer Verlag. https://doi.org/10.1007/978-3-319-22425-1_16