Proxy Signature Without Random Oracles

  • Xinyi Huang
  • Willy Susilo
  • Yi Mu
  • Wei Wu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4325)

Abstract

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.

Keywords

Proxy Signature Without Random Oracles CDH Problem Bilinear Pairings 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xinyi Huang
    • 1
  • Willy Susilo
    • 1
  • Yi Mu
    • 1
  • Wei Wu
    • 1
  1. 1.Center for Information Security Research, School of Information Technology and Computer ScienceUniversity of WollongongWollongongAustralia

Personalised recommendations