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
AN - SCOPUS:84925423412
T3 - Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014
SP - 531
EP - 535
BT - Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2nd International Symposium on Computing and Networking, CANDAR 2014
Y2 - 10 December 2014 through 12 December 2014
ER -