A new universal designated verifier transitive signature scheme for big graph data

We propose a new design of universal designated verifier transitive signatures, to authenticate dynamically growing big graph data. The scheme is built on the classical RSA signature and possesses several desirable properties. It supports edge-signature composition as transitive signatures, i.e., with the signatures of two adjacent edges (i,j) and (j,k), one can obtain a valid signature of the edge (i,k). Additionally, a signature holder can convince only one designated verifier about the existence of an edge. Our design can efficiently achieve a tradeoff between data authenticity (when publishing dynamically growing big graph data) and data privacy (when disseminating big graph data).