Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system

Nasima Begum, Toru Nakanishi, Nobuo Funabiki

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

14 Citations (Scopus)

Abstract

To enhance user privacy, anonymous credential systems allow the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. In the systems, the user can prove relations on his/her attributes embedded into the certificate. Previously, a pairing-based anonymous credential system with constant-size proofs in the number of attributes of the user was proposed. This system supports the proofs of the inner product relations on attributes, and thus can handle the complex logical relations on attributes as the CNF and DNF formulas. However this system suffers from the computational cost: The proof generation needs exponentiations depending on the number of the literals in OR relations. In this paper, we propose a pairing-based anonymous credential system with the constant-size proofs for CNF formulas and the more efficient proof generation. In the proposed system, the proof generation needs only multiplications depending on the number of literals, and thus it is more efficient than the previously proposed system. The key of our construction is to use an extended accumulator, by which we can verify that multiple attributes are included in multiple sets, all at once. This leads to the verification of CNF formulas on attributes. Since the accumulator is mainly calculated by multiplications, we achieve the better computational costs.

Original languageEnglish
Title of host publicationInformation Security and Cryptology, ICISC 2012 - 15th International Conference, Revised Selected Papers
Pages495-509
Number of pages15
DOIs
Publication statusPublished - Apr 15 2013
Event15th International Conference on Information Security and Cryptology, ICISC 2012 - Seoul, Korea, Republic of
Duration: Nov 28 2012Nov 30 2012

Publication series

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

Other

Other15th International Conference on Information Security and Cryptology, ICISC 2012
CountryKorea, Republic of
CitySeoul
Period11/28/1211/30/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

  • Cite this

    Begum, N., Nakanishi, T., & Funabiki, N. (2013). Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system. In Information Security and Cryptology, ICISC 2012 - 15th International Conference, Revised Selected Papers (pp. 495-509). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7839 LNCS). https://doi.org/10.1007/978-3-642-37682-5_35