Universal designated verifier transitive signatures for graph-based big data

In this paper, we propose a new type of digital signatures which is specifically designed for graph-based big data system. The properties of the proposed signatures are twofold. On one side it possesses the features of transitive signatures: One can sign a graph in such a way that, given two signatures on adjacent edges ( i , j ) and ( j , k ) , anyone with public information can compute a signature on edge ( i , k ) . The efficiency advancement ( O ( 1 ) communication overhead) in transitive signatures is especially important in big data paradigm. On the other side, it is universal designated verifiable: It allows any signature holder to prove to a designated verifier that a message has been signed by the signer, but the verifier cannot convince (even sharing all secret information) any other third party of this fact. The new notion is called Universal Designated Verifier Transitive Signatures ( UDVTS for short). As an integration of transitive signatures and universal designated verifier signatures, UDVTS can efficiently address privacy issues associated with dissemination of transitive signatures of graph-based big data. We further prove that our proposed design is secure in the random oracle model.

[1]  Fei Li,et al.  Round-Optimal ID-Based Blind Signature Schemes without ROS Assumption , 2012, J. Commun..

[2]  Reihaneh Safavi-Naini,et al.  Generic constructions for universal designated-verifier signatures and identitybased signatures from standard signatures , 2009, IET Inf. Secur..

[3]  J. Manyika.  Big data: The next frontier for innovation, competition, and productivity , 2011 .

[4]  Yi Mu,et al.  Identity-Based Universal Designated Verifier Signatures , 2005, EUC Workshops.

[5]  Alexandra Boldyreva,et al.  Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme , 2002 .

[6]  Zheng Huang,et al.  Transitive Signature Scheme from LFSR , 2010 .

[7]  Zhenfu Cao,et al.  Transitive Signatures from Braid Groups , 2007, INDOCRYPT.

[8]  Susan Rae Hohenberger,et al.  The cryptographic impact of groups with infeasible inversion , 2003 .

[9]  Gerhard Frey,et al.  The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems , 1999, IEEE Trans. Inf. Theory.

[10]  Silvio Micali,et al.  Transitive Signature Schemes , 2002, CT-RSA.

[11]  Dan Boneh,et al.  Short Signatures Without Random Oracles , 2004, EUROCRYPT.

[12]  Ron Steinfeld,et al.  Universal Designated-Verifier Signatures , 2003, ASIACRYPT.

[13]  Ron Steinfeld,et al.  Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures , 2004, Public Key Cryptography.

[14]  Philippe Camacho,et al.  Short Transitive Signatures for Directed Trees , 2012, CT-RSA.

[15]  Yi Mu,et al.  Universal Designated Multi Verifier Signature Schemes , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[16]  Yi Mu,et al.  Secure universal designated verifier signature without random oracles , 2008, International Journal of Information Security.

[17]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[18]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[19]  Gregory Neven.  A simple transitive signature scheme for directed trees , 2008, Theor. Comput. Sci..

[20]  Chanathip Namprempre,et al.  The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme , 2003, Journal of Cryptology.

[21]  Reihaneh Safavi-Naini,et al.  Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures , 2008, Public Key Cryptography.

[22]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[23]  Fabien Laguillaumie,et al.  On the Soundness of Restricted Universal Designated Verifier Signatures and Dedicated Signatures , 2007, ISC.

[24]  Yi Mu,et al.  Restricted Universal Designated Verifier Signature , 2006, UIC.

[25]  Mihir Bellare,et al.  Transitive Signatures Based on Factoring and RSA , 2002, ASIACRYPT.

[26]  Mihir Bellare,et al.  Transitive signatures: new schemes and proofs , 2005, IEEE Transactions on Information Theory.

[27]  Jean-Jacques Quisquater,et al.  Universal Designated Verifier Signatures Without Random Oracles or Non-black Box Assumptions , 2006, SCN.

[28]  Hideki Imai,et al.  Short Signature and Universal Designated Verifier Signature Without Random Oracles , 2005, ACNS.

[29]  Jin Li,et al.  Universal Designated Verifier Ring Signature (Proof) Without Random Oracles , 2006, EUC Workshops.

[30]  Joonsang Baek,et al.  Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature) , 2005, ASIACRYPT.

[31]  Xun Yi.  Directed Transitive Signature Scheme , 2007, CT-RSA.

[32]  Yi Mu,et al.  Universal Designated Verifier Signature Without Delegatability , 2006, ICICS.