Proxy Signature Without Random Oracles

In mobile Ad Hoc networks, the existence and availability of trusted authorities is severely limited by intrinsic network features, and problems such as “service availability” have become a crucial issue. A proxy signature scheme allows an entity to delegate his/her signing capability to another entity in such a way that the latter can sign messages on behalf of the former when the former is not available. This is an important primitive to ensure the service availability issue. Proxy signatures have found numerous practical applications such as distributed systems, mobile agent applications, etc. However, the security of the known proxy signature schemes is proven in the random oracle which does not imply security in the real world. In this paper, we propose the first proxy signature schemes without random oracle. The unforgeability of our scheme is based on the hardness of the well known Computational Diffie Hellman (CDH) problem.

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

[2]  Byoungcheon Lee,et al.  Secure Mobile Agent Using Strong Non-designated Proxy Signature , 2001, ACISP.

[3]  Brent Waters,et al.  Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.

[4]  Yi Mu,et al.  A Short Proxy Signature Scheme: Efficient Authentication in the Ubiquitous World , 2005, EUC Workshops.

[5]  Liqun Chen,et al.  A Built-in Decisional Function and Security Proof of ID-based Key Agreement Protocols from Pairings , 2006, IACR Cryptol. ePrint Arch..

[6]  Ran Canetti,et al.  The random oracle methodology, revisited , 2000, JACM.

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

[8]  Robert H. Deng,et al.  Security Analysis of Some Proxy Signatures , 2003, ICISC.

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

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

[11]  Ran Canetti,et al.  The random oracle methodology, revisited , 2000, JACM.

[12]  Jung Hee Cheon,et al.  Security Analysis of the Strong Diffie-Hellman Problem , 2006, EUROCRYPT.

[13]  Byoungcheon Lee,et al.  Strong Proxy Signature and its Applications , 2000 .

[14]  M. Mambo,et al.  Proxy Signatures: Delegation of the Power to Sign Messages (Special Section on Information Theory and Its Applications) , 1996 .

[15]  Reihaneh Safavi-Naini,et al.  An Efficient Signature Scheme from Bilinear Pairings and Its Applications , 2004, Public Key Cryptography.

[16]  Takeshi Okamoto,et al.  Extended Proxy Signatures for Smart Cards , 1999, ISW.

[17]  Mihir Bellare,et al.  The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin , 1996, EUROCRYPT.

[18]  Takeshi Okamoto,et al.  A proposal of short proxy signature using pairing , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[19]  Jung Hee Cheon,et al.  An Analysis of Proxy Signatures: Is a Secure Channel Necessary? , 2003, CT-RSA.

[20]  Dongho Won,et al.  Proxy signatures, Revisited , 1997, ICICS.

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