跳到主要导航 跳到搜索 跳到主要内容

Efficient partially blind signature scheme with provable security

  • Zheng Gong*
  • , Xiangxue Li
  • , Kefei Chen
  • *此作品的通讯作者
  • Shanghai Jiao Tong University

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

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.

源语言英语
主期刊名Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings
出版商Springer Verlag
页378-386
页数9
ISBN(印刷版)3540369252, 9783540369257
DOI
出版状态已出版 - 2006
已对外发布是
活动12th Annual International Conference on Computing and Combinatorics, COCOON 2006 - Taipei, 中国台湾
期限: 15 8月 2006 → 18 8月 2006

丛书

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
卷4112 LNCS
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议12th Annual International Conference on Computing and Combinatorics, COCOON 2006
国家/地区中国台湾
市Taipei
时期15/08/06 → 18/08/06

学术指纹

探究 'Efficient partially blind signature scheme with provable security' 的科研主题。它们共同构成独一无二的学术指纹。

引用此