Provably Secure Convertible User Designating Confirmer Partially Blind Signatures

Authors:
Zhenjie Huang;Kefei Chen;Yumin Wang
Affiliations:
Dept. of Comp. Sci. and Eng., Zhangzhou Normal Univ., Fujian and SKL of Info. Sec., Inst. of Softw. of Ch. Acad. of Sci., Beijing and Dept. of C. Sci. and Eng., Shanghai Jiao Tong Univ. and SKL of ...;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200030, P. R. China, e-mail: kfchen@stju.edu.cn;State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, Shaanxi, 710071, P. R. China, e-mail: ymwang@xidian.edu.cn
Venue:
Informatica
Year:
2006

Citing 8
Cited 0

Zero-knowledge proofs of identity

Journal of Cryptology
Modified Maurer-Yacobi`s scheme and its applications

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
A Provably Secure Restrictive Partially Blind Signature Scheme

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Undeniable Signatures

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
How to Date Blind Signatures

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Convertible Undeniable Partially Blind Signatures

AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Partially Blind Threshold Signature Based on RSA

Informatica
Partially blind threshold signatures based on discrete logarithm

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new concept of convertible user designating confirmer partially blind signature, in which only the designated confirmer (designated by the user) and the user can verify and confirm the validity of given signatures and convert given signatures into publicly verifiable ones. We give a formal definition for it and propose a concrete provably secure scheme with a proof of security and a brief analysis of efficiency. Assuming the intractabilities of the Discrete Logarithm Problem and the ROS-Problem, the proposed scheme is unforgeable under adaptive chosen-message attack.