Name
Abstract | ||
|---|---|---|
A nominative signature scheme allows a nominator and a nominee jointly generate a signature in such a way that only the nominee can check the validity of the signature and further convince a third party of the fact. In Inscrypt 2008, Zhao et al. proposed selectively and universally convertible nominative signatures, which equips the nominee with additional ability to publish a selective proof to convert a nominative signature into a publicly verifiable one (i.e. selective convertibility), or issue a universal proof to make all nominative signatures with respect to the nominator and the nominee publicly verifiable (i.e. universal convertibility). Finally, they left an open problem to construct a selectively and universally convertible nominative signature scheme from bilinear pairings which is provably secure under the conventional assumptions. In this paper, based on standard digital signature and undeniable signature, we propose a new selectively and universally convertible nominative signature scheme from bilinear pairings. Our scheme is efficient which is a one-move (i.e. non-interactive) convertible nominative signature scheme, and possesses short signature length compared with Zhao et al.'s scheme. Moreover, formal proofs are given to show that our scheme is secure under some conventional assumptions in the random oracle model. Based on our construction and further analysis, we think that nominative signatures are just the dual form of undeniable signatures in the concept; whether their dual property in the construction of the schemes has generality needs further investigation. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-16342-5_5 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
nominative signature,universal convertibility,standard digital signature,convertible nominative signature,undeniable signature,convertible nominative signature scheme,conventional assumption,pairing-based nominative signature,dual form,short signature length,nominative signature scheme,bilinear pairings,provable security,random oracle model,digital signature | Nominative case,Undeniable signature,Computer science,Random oracle,Ring signature,Theoretical computer science,Digital signature,Mathematical proof,Verifiable secret sharing,Schnorr signature | Conference |
Volume | Issue | ISSN |
6151 LNCS | null | 16113349 |
ISBN | Citations | PageRank |
3-642-16341-6 | 1 | 0.35 |
References | Authors | |
13 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Zhao | 1 | 52 | 21.04 |
| Dingfeng Ye | 2 | 54 | 7.67 |