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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages495-509
Number of pages15
Volume7839 LNCS
DOIs
Publication statusPublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Pairing
Attribute
Costs
Certificate
Computational Cost
Multiplication
Exponentiation
Scalar, inner or dot product
Privacy
Verify

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Begum, N., Nakanishi, T., & Funabiki, N. (2013). Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7839 LNCS, 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

Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system. / Begum, Nasima; Nakanishi, Toru; Funabiki, Nobuo.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7839 LNCS 2013. p. 495-509 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7839 LNCS).

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

Begum, N, Nakanishi, T & Funabiki, N 2013, Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7839 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7839 LNCS, pp. 495-509, 15th International Conference on Information Security and Cryptology, ICISC 2012, Seoul, Korea, Republic of, 11/28/12. https://doi.org/10.1007/978-3-642-37682-5_35
Begum N, Nakanishi T, Funabiki N. Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7839 LNCS. 2013. p. 495-509. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-37682-5_35
Begum, Nasima ; Nakanishi, Toru ; Funabiki, Nobuo. / Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7839 LNCS 2013. pp. 495-509 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6cc59ecf2a2a4dfb9e438c4c34f86559,
title = "Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system",
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.",
author = "Nasima Begum and Toru Nakanishi and Nobuo Funabiki",
year = "2013",
doi = "10.1007/978-3-642-37682-5_35",
language = "English",
isbn = "9783642376818",
volume = "7839 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "495--509",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Begum, Nasima

AU - Nakanishi, Toru

AU - Funabiki, Nobuo

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84876008430&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876008430&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-37682-5_35

DO - 10.1007/978-3-642-37682-5_35

M3 - Conference contribution

AN - SCOPUS:84876008430

SN - 9783642376818

VL - 7839 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 495

EP - 509

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -