Highly Efficient ID-Based Ring Signature from Pairings

A ring signature scheme enables a signer, in an ad hoc manner, to sign a signature on behalf of a group of users including himself such that a verifier can be convinced that one of the identified users actually generated the signature but he cannot identify the actual signer. In this paper, we propose a highly efficient ID-based ring signature from pairings that requires only one pairing operation, which is the least complexity among its counterparts. Additional merits of the scheme include (1) no requirement of admissible encoding function like the MaptoPoint, and (2) parallelism of computing operations of the ring signature generation.