(Strong) multidesignated verifiers signatures secure against rogue key attack. (5th July 2013)

• Record Type: Journal Article
• Authors: Au, Man Ho; Yang, Guomin; Susilo, Willy; Zhang, Yunmei; Xu, Li; Bertino, Elisa; Mu, Yi
• Is Part Of: Concurrency and computation. Volume 26:Number 8(2014:Jun.)
• Page Start: 1574
• Page End: 1592
• Publication Date: 2013-07-05
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3094
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3094-abs-0001"> <title>SUMMARY</title> <p id="cpe3094-para-0001">Designated verifier signatures (DVS) allow a signer to create a signature whose validity can only be verified by a specific entity chosen by the signer. In addition, the chosen entity, known as the designated verifier, cannot convince any body that the signature is created by the signer. Multidesignated verifiers signatures (MDVS) are a natural extension of DVS in which the signer can choose multiple designated verifiers. DVS and MDVS are useful primitives in electronic voting and contract signing. In this paper, we investigate various aspects of MDVS and make two contributions. Firstly, we revisit the notion of unforgeability under rogue key attack on MDVS. In this attack scenario, a malicious designated verifier tries to forge a signature that passes through the verification of another honest designated verifier. A common counter‐measure involves making the knowledge of secret key assumption in which an adversary is required to produce a proof‐of‐knowledge of the secret key. We strengthened the existing security model to capture this attack and propose a new construction that does not rely on the knowledge of secret key assumption. Secondly, we propose a generic construction of strong MDVS. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>