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

30 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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages246-263
Number of pages18
Volume6794 LNCS
DOIs
Publication statusPublished - 2011
Event11th International Symposium on Privacy Enhancing Technologies, PETS 2011 - Waterloo, ON, Canada
Duration: Jul 27 2011Jul 29 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6794 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other11th International Symposium on Privacy Enhancing Technologies, PETS 2011
CountryCanada
CityWaterloo, ON
Period7/27/117/29/11

Fingerprint

Pairing
Attribute
Certificate
Finite Set
Zero-knowledge Proof
Large Set
Privacy
Electronics
Output

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Sudarsono, A., Nakanishi, T., & Funabiki, N. (2011). Efficient proofs of 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. 6794 LNCS, pp. 246-263). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6794 LNCS). https://doi.org/10.1007/978-3-642-22263-4_14

Efficient proofs of attributes in pairing-based anonymous credential system. / Sudarsono, Amang; Nakanishi, Toru; Funabiki, Nobuo.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6794 LNCS 2011. p. 246-263 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6794 LNCS).

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

Sudarsono, A, Nakanishi, T & Funabiki, N 2011, Efficient proofs of 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. 6794 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6794 LNCS, pp. 246-263, 11th International Symposium on Privacy Enhancing Technologies, PETS 2011, Waterloo, ON, Canada, 7/27/11. https://doi.org/10.1007/978-3-642-22263-4_14
Sudarsono A, Nakanishi T, Funabiki N. Efficient proofs of 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. 6794 LNCS. 2011. p. 246-263. (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-22263-4_14
Sudarsono, Amang ; Nakanishi, Toru ; Funabiki, Nobuo. / Efficient proofs of 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. 6794 LNCS 2011. pp. 246-263 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9ee999d03eb946e8bd89d82c1d23db86,
title = "Efficient proofs of attributes in pairing-based anonymous credential system",
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.",
author = "Amang Sudarsono and Toru Nakanishi and Nobuo Funabiki",
year = "2011",
doi = "10.1007/978-3-642-22263-4_14",
language = "English",
isbn = "9783642222627",
volume = "6794 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "246--263",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Efficient proofs of attributes in pairing-based anonymous credential system

AU - Sudarsono, Amang

AU - Nakanishi, Toru

AU - Funabiki, Nobuo

PY - 2011

Y1 - 2011

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

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

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

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

U2 - 10.1007/978-3-642-22263-4_14

DO - 10.1007/978-3-642-22263-4_14

M3 - Conference contribution

AN - SCOPUS:79961193039

SN - 9783642222627

VL - 6794 LNCS

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

SP - 246

EP - 263

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

ER -