One-time proxy signatures revisited

Bicakci K.

COMPUTER STANDARDS & INTERFACES, vol.29, no.4, pp.499-505, 2007 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 29 Issue: 4
  • Publication Date: 2007
  • Doi Number: 10.1016/j.csi.2006.12.001
  • Journal Name: COMPUTER STANDARDS & INTERFACES
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.499-505
  • Middle East Technical University Affiliated: No

Abstract

Proxy signatures are useful constructions in grid computing, mobile agents and many other emerging applications. In a recent work [Huaxiong Wang and Josef Pieprzyk: Efficient One-Time Proxy Signatures. Proc. ASIACRYPT'03, LNCS 2894, Springer 2003.], Wang and Pieprzyk proposed a one-time signature scheme which allows full delegation to a proxy with an added feature that allows tracing the authorship of the signature in case of a dispute. In this paper we present a simple alternative approach that eliminates public-key cryptography in key generation, offers certainty and simplicity in the dispute resolution and avoids swallow attacks. We also introduce the concept of 1-out-of-n threshold traceable one-time signatures as an efficiency improvement. (C) 2007 Elsevier B.V. All rights reserved.