An Efficient and Provably Secure Threshold Blind Signature

Kim, Jin-Ho; Kim, Kwangjo; Lee, Chulsoo

doi:10.1007/3-540-45861-1_24

Cited by 14 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And Kim et al [15] also put forth an efficient and provably secure threshold blind signature scheme, which was claimed more efficient and more secure compared with the former schemes [11,12] . More recently, Vo et al [16] proposed a new threshold blind signature from bilinear parings.…”

Section: Introductionmentioning

confidence: 97%

Provably secure robust threshold partial blind signature

Cao

Zhu

2006

SCI CHINA SER F

View full text Add to dashboard Cite

Threshold digital signature and blind signature are playing important roles in cryptography as well as in practical applications such as e-cash and e-voting systems. Over the past few years, many cryptographic researchers have made considerable headway in this field. However, to our knowledge, most of existing threshold blind signature schemes are based on the discrete logarithm problem. In this paper, we propose a new robust threshold partial blind signature scheme based on improved RSA cryptosystem. This scheme is the first threshold partial blind signature scheme based on factoring, and the robustness of threshold partial blind signature is also introduced. Moreover, in practical application, the proposed scheme will be especially suitable for blind signature-based voting systems with multiple administrators and secure electronic cash systems to prevent their abuse.

show abstract

Section: Introductionmentioning

confidence: 97%

Provably secure robust threshold partial blind signature

Cao

Zhu

2006

SCI CHINA SER F

View full text Add to dashboard Cite

show abstract

“…Our partially blind fuzzy signatures are compatible with the ECDSA signatures in the existing Bitcoin system, but allow to enforces flexible and complicated security policies. The partially blind threshold signatures with uncertain signers are employed to prevent the platform from observing the details of transactions (Jinho et al 2002;Cui et al 2007) to guarantee privacy for the users. The schemes also protect the trading platforms by allowing them to embed some public information negotiated with the recipients in advance to avoid the privacy-preserving mechanism is abused.…”

Section: Introductionmentioning

confidence: 99%

Secure joint Bitcoin trading with partially blind fuzzy signatures

Zhou

Qin

et al. 2015

Soft Comput

View full text Add to dashboard Cite

Bitcoin has recently received considerable attentions in both academia and industrial areas. It is an appealing anonymous electronic cash system-based peer-to-peer computer networks and does not rely on any centralized trusted authority. The Bitcoin is associated with a public/secret key pair where the security key is only known by its Bitcoin account owner. It is usually hosted on some platform and can only be spent after its owner and the platform sign on Communicated by V. Loia. B Yong Ding

show abstract

“…In 1994, the blinding schemes [17] of the modification of DSA scheme and Nyberg-Rueppel message recovery signature scheme were presented by Camenisch. Because blind signatures [2,5,6,7,8,9,10] can realize privacy protect of the user, it has been widely used in numerous electronic commerce security, most prominently in anonymous voting and anonymous e-cash.…”

Section: Introductionmentioning

confidence: 99%

Efficient Blind Signature Scheme based on Modified Generalized Bilinear Inversion for Multiple Signers

Zhang¹,

Chen²,

Gao³

2010

JDCTA

View full text Add to dashboard Cite

As a special anonymous signature, the blindness of blind signatures makes it to play an important role in electronic commerce. Sometimes, we need a blind signature under the multiple signers. However, to the best of our knowledge, the research on the blind signer for multiple signers is much less. In this paper, we propose a novel blind signature scheme for multiple signers based on a new security assumption. Then, we give a formal proof of security for the proposed schemes in the random oracle model. And we show that the proposed scheme satisfies the two properties of blind signature: blindness and unforgeability. As for the size of blind signature in the scheme, the length of our blind signature is independent of the numbers of signers and is approximate 320 bits. In terms of computation, no pairings operators are required in the blind signing phase and one pairing operator is needed in the verification phase. Thus, our scheme is very efficient.

show abstract

An Efficient and Provably Secure Threshold Blind Signature

Cited by 14 publications

References 14 publications

Provably secure robust threshold partial blind signature

Provably secure robust threshold partial blind signature

Secure joint Bitcoin trading with partially blind fuzzy signatures

Efficient Blind Signature Scheme based on Modified Generalized Bilinear Inversion for Multiple Signers

Contact Info

Product

Resources

About