Open Access. Powered by Scholars. Published by Universities.®

Science and Technology Studies Commons

Open Access. Powered by Scholars. Published by Universities.®

2007

University of Wollongong

Engineering

Nominative

Articles 1 - 2 of 2

Full-Text Articles in Science and Technology Studies

Further Discussions On The Security Of A Nominative Signature Scheme, Lifeng Guo, Guilin Wang, Duncan S. Wong Jan 2007

Further Discussions On The Security Of A Nominative Signature Scheme, Lifeng Guo, Guilin Wang, Duncan S. Wong

Faculty of Engineering and Information Sciences - Papers: Part A

A nominative signature scheme allows a nominator (or signer) and a nominee (or veri¯er) to jointly generate and publish a signature in such a way that only the nominee can verify the signature and if nec- essary, only the nominee can prove to a third party that the signature is valid. In a recent work, Huang and Wang proposed a new nominative signature scheme which, in addition to the above properties, only allows the nominee to convert a nominative signature to a publicly veri¯able one. In ACISP 2005, Susilo and Mu presented several algorithms and claimed that these algorithms can …


Security Remarks On A Convertible Nominative Signature Scheme, Guilin Wang, Feng Bao Jan 2007

Security Remarks On A Convertible Nominative Signature Scheme, Guilin Wang, Feng Bao

Faculty of Engineering and Information Sciences - Papers: Part A

A nominative signature scheme allows a nominator (i.e. the signer) and a nominee (i.e. a designated verifier) to jointly generate and publish a signature so that only the nominee can check the validity of a nominative signature and further convince a third party to accept this fact. Recently, Huang and Wang proposed such a new scheme at ACISP 2004, and claimed that their scheme is secure under some standard computational assumptions. In this paper, we remark that their scheme is not a nominative signature in fact, since it fails to meet the crucial security requirement: verification untransferability. Specifically, we identify …