An efficiency improvement in an anonymous credential system for CNF formulas on attributes with constant-size proofs

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, we proposed a paring-based anonymous credential system with constant size of proofs, where the combinations of logical AND and OR relations on user attributes can be proved as CNF formulas. However, this system has a problem of requiring large online computation time during authentication, which depends on the number of AND relations in the proved formula. In this paper, we propose an efficiency improvement of the computational overhead based on online/offline precomputation technique. In our improvement, all exponentiations that can be used for the accumulator and witness computations are executed in advance in the precomputation algorithm. Thus, exponentiations in the online accumulator and witness computations are excluded, and only multiplications are needed. We implemented the system using a fast pairing library, and measured the processing times, while changing the size of the proved CNF formula. The experimental result shows that the computational costs of the proof generation in the case of using lots of AND relations are greatly reduced than the previous system. Hence, it is practical for mobile users.

Original languageEnglish
Title of host publication2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)9781467366762
DOIs
Publication statusPublished - Oct 26 2015
Event2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015 - Savar, Dhaka, Bangladesh
Duration: May 21 2015May 23 2015

Other

Other2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015
CountryBangladesh
CitySavar, Dhaka
Period5/21/155/23/15

Fingerprint

Authentication
Processing
Costs

Keywords

  • anonymity
  • anonymous credentials
  • attributes
  • CNF formulas

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Begum, N., Nakanishi, T., & Nogami, Y. (2015). An efficiency improvement in an anonymous credential system for CNF formulas on attributes with constant-size proofs. In 2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015 [7307538] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICEEICT.2015.7307538

An efficiency improvement in an anonymous credential system for CNF formulas on attributes with constant-size proofs. / Begum, Nasima; Nakanishi, Toru; Nogami, Yasuyuki.

2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7307538.

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

Begum, N, Nakanishi, T & Nogami, Y 2015, An efficiency improvement in an anonymous credential system for CNF formulas on attributes with constant-size proofs. in 2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015., 7307538, Institute of Electrical and Electronics Engineers Inc., 2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015, Savar, Dhaka, Bangladesh, 5/21/15. https://doi.org/10.1109/ICEEICT.2015.7307538
Begum N, Nakanishi T, Nogami Y. An efficiency improvement in an anonymous credential system for CNF formulas on attributes with constant-size proofs. In 2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015. Institute of Electrical and Electronics Engineers Inc. 2015. 7307538 https://doi.org/10.1109/ICEEICT.2015.7307538
Begum, Nasima ; Nakanishi, Toru ; Nogami, Yasuyuki. / An efficiency improvement in an anonymous credential system for CNF formulas on attributes with constant-size proofs. 2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015. Institute of Electrical and Electronics Engineers Inc., 2015.
@inproceedings{b04fa6b7e345421089052270d3a64f8e,
title = "An efficiency improvement in an anonymous credential system for CNF formulas on attributes with constant-size proofs",
abstract = "An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, we proposed a paring-based anonymous credential system with constant size of proofs, where the combinations of logical AND and OR relations on user attributes can be proved as CNF formulas. However, this system has a problem of requiring large online computation time during authentication, which depends on the number of AND relations in the proved formula. In this paper, we propose an efficiency improvement of the computational overhead based on online/offline precomputation technique. In our improvement, all exponentiations that can be used for the accumulator and witness computations are executed in advance in the precomputation algorithm. Thus, exponentiations in the online accumulator and witness computations are excluded, and only multiplications are needed. We implemented the system using a fast pairing library, and measured the processing times, while changing the size of the proved CNF formula. The experimental result shows that the computational costs of the proof generation in the case of using lots of AND relations are greatly reduced than the previous system. Hence, it is practical for mobile users.",
keywords = "anonymity, anonymous credentials, attributes, CNF formulas",
author = "Nasima Begum and Toru Nakanishi and Yasuyuki Nogami",
year = "2015",
month = "10",
day = "26",
doi = "10.1109/ICEEICT.2015.7307538",
language = "English",
isbn = "9781467366762",
booktitle = "2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - An efficiency improvement in an anonymous credential system for CNF formulas on attributes with constant-size proofs

AU - Begum, Nasima

AU - Nakanishi, Toru

AU - Nogami, Yasuyuki

PY - 2015/10/26

Y1 - 2015/10/26

N2 - An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, we proposed a paring-based anonymous credential system with constant size of proofs, where the combinations of logical AND and OR relations on user attributes can be proved as CNF formulas. However, this system has a problem of requiring large online computation time during authentication, which depends on the number of AND relations in the proved formula. In this paper, we propose an efficiency improvement of the computational overhead based on online/offline precomputation technique. In our improvement, all exponentiations that can be used for the accumulator and witness computations are executed in advance in the precomputation algorithm. Thus, exponentiations in the online accumulator and witness computations are excluded, and only multiplications are needed. We implemented the system using a fast pairing library, and measured the processing times, while changing the size of the proved CNF formula. The experimental result shows that the computational costs of the proof generation in the case of using lots of AND relations are greatly reduced than the previous system. Hence, it is practical for mobile users.

AB - An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, we proposed a paring-based anonymous credential system with constant size of proofs, where the combinations of logical AND and OR relations on user attributes can be proved as CNF formulas. However, this system has a problem of requiring large online computation time during authentication, which depends on the number of AND relations in the proved formula. In this paper, we propose an efficiency improvement of the computational overhead based on online/offline precomputation technique. In our improvement, all exponentiations that can be used for the accumulator and witness computations are executed in advance in the precomputation algorithm. Thus, exponentiations in the online accumulator and witness computations are excluded, and only multiplications are needed. We implemented the system using a fast pairing library, and measured the processing times, while changing the size of the proved CNF formula. The experimental result shows that the computational costs of the proof generation in the case of using lots of AND relations are greatly reduced than the previous system. Hence, it is practical for mobile users.

KW - anonymity

KW - anonymous credentials

KW - attributes

KW - CNF formulas

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

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

U2 - 10.1109/ICEEICT.2015.7307538

DO - 10.1109/ICEEICT.2015.7307538

M3 - Conference contribution

AN - SCOPUS:84962135617

SN - 9781467366762

BT - 2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -