Efficient Attributes Proof on CNF Relation for eID System
Nan Guo, Wenwei Jiang, Jiayi Ouyang, Tianhan Gao, Bin Zhang · Research Briefs on Information and Communication Technology Evolution · 2016
Electronic identity system is a user-centric identity management system which emphasizes the balancebetween security and privacy during authentication and authorization. Users can selectivelydisclose any combination of attributes and prove relations over them instead of being identified.Several attributes proof protocols are proposed to prove simple and complex logic over multiple attributes.However, the cryptographic building blocks to construct these protocols generally of largesize of public parameter and signature, and also the complexity w.r.t. the concrete number of pairingand exponentiation operation is too large to be practical in source-limited devices. In this paper, wefocus on reducing the complexity and the signature size in attributes proof procedure. We firstlydemonstrate the application scenario, and then give an extended Boneh-Lynn-Shacham short signaturescheme to construct an efficient pairing-based credential. We also describe the protocol ofattributes proof on CNF relation, where the complexity is linear with the number of clauses insteadof the attributes embedded in the credential or specified in the security policy.