Efficient partially blind signature scheme with provable security

Zheng Gong, Xiangxue Li, Kefei Chen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Partially blind signature was first introduced by Abe and Fujisaki. Subsequently, Abe and Okamoto proposed a provably secure construction for partially blind signature schemes with a formalized definition in their work. In this paper, based on discrete logarithm problem and the Schnorr's blind signature scheme, we propose a new efficient partially blind signature scheme. Follow the construction proposed by Abe and Okamoto, we prove its security in random oracle model. The computation and communication costs are both reduced in our scheme. It will make privacy-oriented applications which based on partially blind signatures more efficient and suitable for hardware-limited environment, such as smart phones and PDAs.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings
PublisherSpringer Verlag
Pages378-386
Number of pages9
ISBN (Print)3540369252, 9783540369257
DOIs
StatePublished - 2006
Externally publishedYes
Event12th Annual International Conference on Computing and Combinatorics, COCOON 2006 - Taipei, Taiwan, Province of China
Duration: 15 Aug 200618 Aug 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4112 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th Annual International Conference on Computing and Combinatorics, COCOON 2006
Country/TerritoryTaiwan, Province of China
CityTaipei
Period15/08/0618/08/06

Fingerprint

Dive into the research topics of 'Efficient partially blind signature scheme with provable security'. Together they form a unique fingerprint.

Cite this