Security pitfalls of an efficient threshold proxy signature scheme for mobile agents

Yong Yu, Yi Mu, Willy Susilo, Man Ho Allen Au

Research output: Journal article publicationJournal articleAcademic researchpeer-review

2 Citations (Scopus)

Abstract

A (t,n) threshold proxy signature scheme enables an original signer to delegate his/her signing power to n proxy signers such that any t or more proxy signers can sign messages on behalf of the original signer, but t-1 or less of them cannot produce a valid proxy signature. Based on the RSA cryptosystem, Hong proposed an efficient (t,n) threshold proxy signature for mobile agents. Cai et al. found that the scheme due to Hong is proxy-unprotected, meaning that the original signer can generate a valid proxy signature by himself. However, it is unclear whether the scheme can be used in reality after fixing the security problem discovered by Cai et al. In this letter, we provide a detailed analysis on HongEs scheme and show that the scheme fails to achieve the properties of secrecy, proxy protected, undeniability, identifiability and even time constraint and thus adopted of this efficient construction in practice is not recommended.
Original languageEnglish
Pages (from-to)5-8
Number of pages4
JournalInformation Processing Letters
Volume114
Issue number1-2
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes

Keywords

  • Cryptography
  • Digital signature
  • Proxy signature
  • RSA cryptosystem
  • Security analysis

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this