Reduction of authentication time in an anonymous credential system with proofs for monotone formulas on attributes

Nasima Begum, Toru Nakanishi, Yasuyuki Nogami

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

Abstract

An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, an anonymous credential system was proposed to prove user's attributes to satisfy a monotone formula, i.e., a logic relation with any combination of AND/OR relations. However, this system has a problem of requiring large authentication time which depends on the number of attributes in the proved formula. In this paper, we propose methods to accelerate the authentication time by reducing the exponentiation costs for the calculations of accumulator and the witness which are used in the system. We implemented the accelerated system using a fast pairing library, and measured the authentication times, while changing the size of the proved relation.

Original languageEnglish
Title of host publication2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages376-377
Number of pages2
ISBN (Print)9781479987443
DOIs
Publication statusPublished - Aug 20 2015
Event2nd IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015 - Taipei, Taiwan, Province of China
Duration: Jun 6 2015Jun 8 2015

Other

Other2nd IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015
CountryTaiwan, Province of China
CityTaipei
Period6/6/156/8/15

Fingerprint

Authentication
accumulators
logic
costs
Costs

Keywords

  • Acceleration
  • Authentication
  • Communication networks
  • Libraries
  • Privacy
  • Size measurement
  • Velocity measurement

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Instrumentation
  • Media Technology

Cite this

Begum, N., Nakanishi, T., & Nogami, Y. (2015). Reduction of authentication time in an anonymous credential system with proofs for monotone formulas on attributes. In 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015 (pp. 376-377). [7216952] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCE-TW.2015.7216952

Reduction of authentication time in an anonymous credential system with proofs for monotone formulas on attributes. / Begum, Nasima; Nakanishi, Toru; Nogami, Yasuyuki.

2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 376-377 7216952.

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

Begum, N, Nakanishi, T & Nogami, Y 2015, Reduction of authentication time in an anonymous credential system with proofs for monotone formulas on attributes. in 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015., 7216952, Institute of Electrical and Electronics Engineers Inc., pp. 376-377, 2nd IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015, Taipei, Taiwan, Province of China, 6/6/15. https://doi.org/10.1109/ICCE-TW.2015.7216952
Begum N, Nakanishi T, Nogami Y. Reduction of authentication time in an anonymous credential system with proofs for monotone formulas on attributes. In 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 376-377. 7216952 https://doi.org/10.1109/ICCE-TW.2015.7216952
Begum, Nasima ; Nakanishi, Toru ; Nogami, Yasuyuki. / Reduction of authentication time in an anonymous credential system with proofs for monotone formulas on attributes. 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 376-377
@inproceedings{20858b77ef5242a1ab658664b0e6a8d3,
title = "Reduction of authentication time in an anonymous credential system with proofs for monotone formulas on attributes",
abstract = "An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, an anonymous credential system was proposed to prove user's attributes to satisfy a monotone formula, i.e., a logic relation with any combination of AND/OR relations. However, this system has a problem of requiring large authentication time which depends on the number of attributes in the proved formula. In this paper, we propose methods to accelerate the authentication time by reducing the exponentiation costs for the calculations of accumulator and the witness which are used in the system. We implemented the accelerated system using a fast pairing library, and measured the authentication times, while changing the size of the proved relation.",
keywords = "Acceleration, Authentication, Communication networks, Libraries, Privacy, Size measurement, Velocity measurement",
author = "Nasima Begum and Toru Nakanishi and Yasuyuki Nogami",
year = "2015",
month = "8",
day = "20",
doi = "10.1109/ICCE-TW.2015.7216952",
language = "English",
isbn = "9781479987443",
pages = "376--377",
booktitle = "2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Reduction of authentication time in an anonymous credential system with proofs for monotone formulas on attributes

AU - Begum, Nasima

AU - Nakanishi, Toru

AU - Nogami, Yasuyuki

PY - 2015/8/20

Y1 - 2015/8/20

N2 - An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, an anonymous credential system was proposed to prove user's attributes to satisfy a monotone formula, i.e., a logic relation with any combination of AND/OR relations. However, this system has a problem of requiring large authentication time which depends on the number of attributes in the proved formula. In this paper, we propose methods to accelerate the authentication time by reducing the exponentiation costs for the calculations of accumulator and the witness which are used in the system. We implemented the accelerated system using a fast pairing library, and measured the authentication times, while changing the size of the proved relation.

AB - An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, an anonymous credential system was proposed to prove user's attributes to satisfy a monotone formula, i.e., a logic relation with any combination of AND/OR relations. However, this system has a problem of requiring large authentication time which depends on the number of attributes in the proved formula. In this paper, we propose methods to accelerate the authentication time by reducing the exponentiation costs for the calculations of accumulator and the witness which are used in the system. We implemented the accelerated system using a fast pairing library, and measured the authentication times, while changing the size of the proved relation.

KW - Acceleration

KW - Authentication

KW - Communication networks

KW - Libraries

KW - Privacy

KW - Size measurement

KW - Velocity measurement

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

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

U2 - 10.1109/ICCE-TW.2015.7216952

DO - 10.1109/ICCE-TW.2015.7216952

M3 - Conference contribution

AN - SCOPUS:84959500675

SN - 9781479987443

SP - 376

EP - 377

BT - 2015 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -