An Efficient Verification of CL-LRSW Signatures and a Pseudonym Certificate System

We present an efficient interactive verification of Camenisch's and Lysyanskaya's LRSW-based signatures with hidden attributes. In our construction, a signature owner computes no bilinear mappings and does not operate in bilinear mapping function image group. Computation complexity is also reduced for a Verifier. We construct a pairing-based Pseudonymous Domain Certificate system which can be used as a building block for pseudonymous signatures and identification systems.