Implementation of anonymous credential system with efficient proofs for monotone formulas on attributes excluding restriction

Shahidatul Sadiah, Toru Nakanishi, Nobuo Funabiki

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 an anonymous credential system 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 restriction that the user can prove the monotone formula when only one attribute is true for any OR relation. Recently, we proposed the improved system to overcome the restriction, by adopting Linear Homonorphic (LH) signature scheme to generate a certificate that contains the minimum attribute set as required in the verification. However, the improved system has never been implemented, and thus the practicality is not evaluated. In this paper, we implement the system using a fast pairing library, and measure the processing times and data sizes, when changing the number of user's attributes and the size of the proved relation.

Original languageEnglish
Title of host publicationProceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages531-535
Number of pages5
ISBN (Print)9781479941520
DOIs
Publication statusPublished - Feb 27 2015
Event2nd International Symposium on Computing and Networking, CANDAR 2014 - Shizuoka, Japan
Duration: Dec 10 2014Dec 12 2014

Other

Other2nd International Symposium on Computing and Networking, CANDAR 2014
CountryJapan
CityShizuoka
Period12/10/1412/12/14

Fingerprint

Processing

Keywords

  • Anonymity
  • Attribute
  • Attribute authentication
  • Authentication
  • Monotone formula

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Sadiah, S., Nakanishi, T., & Funabiki, N. (2015). Implementation of anonymous credential system with efficient proofs for monotone formulas on attributes excluding restriction. In Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014 (pp. 531-535). [7052241] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CANDAR.2014.35

Implementation of anonymous credential system with efficient proofs for monotone formulas on attributes excluding restriction. / Sadiah, Shahidatul; Nakanishi, Toru; Funabiki, Nobuo.

Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014. Institute of Electrical and Electronics Engineers Inc., 2015. p. 531-535 7052241.

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

Sadiah, S, Nakanishi, T & Funabiki, N 2015, Implementation of anonymous credential system with efficient proofs for monotone formulas on attributes excluding restriction. in Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014., 7052241, Institute of Electrical and Electronics Engineers Inc., pp. 531-535, 2nd International Symposium on Computing and Networking, CANDAR 2014, Shizuoka, Japan, 12/10/14. https://doi.org/10.1109/CANDAR.2014.35
Sadiah S, Nakanishi T, Funabiki N. Implementation of anonymous credential system with efficient proofs for monotone formulas on attributes excluding restriction. In Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014. Institute of Electrical and Electronics Engineers Inc. 2015. p. 531-535. 7052241 https://doi.org/10.1109/CANDAR.2014.35
Sadiah, Shahidatul ; Nakanishi, Toru ; Funabiki, Nobuo. / Implementation of anonymous credential system with efficient proofs for monotone formulas on attributes excluding restriction. Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 531-535
@inproceedings{3ecd9b367c084e14954e45469aa90b6a,
title = "Implementation of anonymous credential system with efficient proofs for monotone formulas on attributes excluding restriction",
abstract = "An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, we proposed an anonymous credential system 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 restriction that the user can prove the monotone formula when only one attribute is true for any OR relation. Recently, we proposed the improved system to overcome the restriction, by adopting Linear Homonorphic (LH) signature scheme to generate a certificate that contains the minimum attribute set as required in the verification. However, the improved system has never been implemented, and thus the practicality is not evaluated. In this paper, we implement the system using a fast pairing library, and measure the processing times and data sizes, when changing the number of user's attributes and the size of the proved relation.",
keywords = "Anonymity, Attribute, Attribute authentication, Authentication, Monotone formula",
author = "Shahidatul Sadiah and Toru Nakanishi and Nobuo Funabiki",
year = "2015",
month = "2",
day = "27",
doi = "10.1109/CANDAR.2014.35",
language = "English",
isbn = "9781479941520",
pages = "531--535",
booktitle = "Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Implementation of anonymous credential system with efficient proofs for monotone formulas on attributes excluding restriction

AU - Sadiah, Shahidatul

AU - Nakanishi, Toru

AU - Funabiki, Nobuo

PY - 2015/2/27

Y1 - 2015/2/27

N2 - An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, we proposed an anonymous credential system 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 restriction that the user can prove the monotone formula when only one attribute is true for any OR relation. Recently, we proposed the improved system to overcome the restriction, by adopting Linear Homonorphic (LH) signature scheme to generate a certificate that contains the minimum attribute set as required in the verification. However, the improved system has never been implemented, and thus the practicality is not evaluated. In this paper, we implement the system using a fast pairing library, and measure the processing times and data sizes, when changing the number of user's attributes and 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, we proposed an anonymous credential system 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 restriction that the user can prove the monotone formula when only one attribute is true for any OR relation. Recently, we proposed the improved system to overcome the restriction, by adopting Linear Homonorphic (LH) signature scheme to generate a certificate that contains the minimum attribute set as required in the verification. However, the improved system has never been implemented, and thus the practicality is not evaluated. In this paper, we implement the system using a fast pairing library, and measure the processing times and data sizes, when changing the number of user's attributes and the size of the proved relation.

KW - Anonymity

KW - Attribute

KW - Attribute authentication

KW - Authentication

KW - Monotone formula

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

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

U2 - 10.1109/CANDAR.2014.35

DO - 10.1109/CANDAR.2014.35

M3 - Conference contribution

SN - 9781479941520

SP - 531

EP - 535

BT - Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -