An implementation of a pairing-based anonymous credential system with constant complexity

Amang Sudarsono, Toru Nakanishi, Nobuo Funabiki

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

2 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 the constant complexity for the number of user's attributes. However, due to the use of RSA-based cryptography, it still suffers from a high cost computation. Recently, we proposed an anonymous credential system with the constant complexity using a pairing-based accumulator, where more efficient ECC (Elliptic Curve Cryptography) can be used instead of the RSA. In this paper, we present an implementation of the anonymous credential system in the application to the eID. We show the practicality of the system from experimental results that the processing times are constantly less than a second.

Original languageEnglish
Title of host publicationIMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011
Pages630-635
Number of pages6
Volume1
Publication statusPublished - 2011
EventInternational MultiConference of Engineers and Computer Scientists 2011, IMECS 2011 - Kowloon, Hong Kong
Duration: Mar 16 2011Mar 18 2011

Other

OtherInternational MultiConference of Engineers and Computer Scientists 2011, IMECS 2011
CountryHong Kong
CityKowloon
Period3/16/113/18/11

Fingerprint

Cryptography
Processing
Costs

Keywords

  • Anonymous credentials
  • Authentications
  • Electronic ID
  • Pairings
  • Privacy

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Sudarsono, A., Nakanishi, T., & Funabiki, N. (2011). An implementation of a pairing-based anonymous credential system with constant complexity. In IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011 (Vol. 1, pp. 630-635)

An implementation of a pairing-based anonymous credential system with constant complexity. / Sudarsono, Amang; Nakanishi, Toru; Funabiki, Nobuo.

IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011. Vol. 1 2011. p. 630-635.

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

Sudarsono, A, Nakanishi, T & Funabiki, N 2011, An implementation of a pairing-based anonymous credential system with constant complexity. in IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011. vol. 1, pp. 630-635, International MultiConference of Engineers and Computer Scientists 2011, IMECS 2011, Kowloon, Hong Kong, 3/16/11.
Sudarsono A, Nakanishi T, Funabiki N. An implementation of a pairing-based anonymous credential system with constant complexity. In IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011. Vol. 1. 2011. p. 630-635
Sudarsono, Amang ; Nakanishi, Toru ; Funabiki, Nobuo. / An implementation of a pairing-based anonymous credential system with constant complexity. IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011. Vol. 1 2011. pp. 630-635
@inproceedings{9f2e163c47494c5bb0563b40a53c1e87,
title = "An implementation of a pairing-based anonymous credential system with constant complexity",
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 the constant complexity for the number of user's attributes. However, due to the use of RSA-based cryptography, it still suffers from a high cost computation. Recently, we proposed an anonymous credential system with the constant complexity using a pairing-based accumulator, where more efficient ECC (Elliptic Curve Cryptography) can be used instead of the RSA. In this paper, we present an implementation of the anonymous credential system in the application to the eID. We show the practicality of the system from experimental results that the processing times are constantly less than a second.",
keywords = "Anonymous credentials, Authentications, Electronic ID, Pairings, Privacy",
author = "Amang Sudarsono and Toru Nakanishi and Nobuo Funabiki",
year = "2011",
language = "English",
isbn = "9789881821034",
volume = "1",
pages = "630--635",
booktitle = "IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011",

}

TY - GEN

T1 - An implementation of a pairing-based anonymous credential system with constant complexity

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 the constant complexity for the number of user's attributes. However, due to the use of RSA-based cryptography, it still suffers from a high cost computation. Recently, we proposed an anonymous credential system with the constant complexity using a pairing-based accumulator, where more efficient ECC (Elliptic Curve Cryptography) can be used instead of the RSA. In this paper, we present an implementation of the anonymous credential system in the application to the eID. We show the practicality of the system from experimental results that the processing times are constantly less than a second.

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 the constant complexity for the number of user's attributes. However, due to the use of RSA-based cryptography, it still suffers from a high cost computation. Recently, we proposed an anonymous credential system with the constant complexity using a pairing-based accumulator, where more efficient ECC (Elliptic Curve Cryptography) can be used instead of the RSA. In this paper, we present an implementation of the anonymous credential system in the application to the eID. We show the practicality of the system from experimental results that the processing times are constantly less than a second.

KW - Anonymous credentials

KW - Authentications

KW - Electronic ID

KW - Pairings

KW - Privacy

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

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

M3 - Conference contribution

AN - SCOPUS:79960616761

SN - 9789881821034

VL - 1

SP - 630

EP - 635

BT - IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011

ER -