MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Provably Secure Blind Threshold Signatures Based on Discrete Logarithm

Download:
Download as a PDF | Download as a PS
by Chin-laung Lei, Wen-shenq Juang, Pei-ling Yu
http://crypto.ee.ntu.edu.tw/~vimal/papers/ncs99ff.ps
Add To MetaCart

Abstract:

In this paper, we propose a provably secure grouporiented blind (t; n) threshold signature scheme which is the first scheme, such that, its security is proved as equivalent as the discrete logarithm problem in the random oracle model. By the scheme, any t out of n signers in a group can represent the group to sign blind threshold signatures, which can be used in anonymous digital e-cash systems or secure voting systems. By our proposed scheme, the issue of e-coins is controlled by several authorities. In our scheme, the size of a blind threshold signature is the same as that of an individual blind signature and the signature verification process is equivalent to that of an individual signature.

Citations

2079 A method for obtaining digital signatures and public-key cryptosystems – Rivest, Shamir, et al. - 1978
832 A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms – ElGamal - 1985
767 Untraceable electronic mail, return addresses, and digital pseudonyms – Chaum - 1981
722 The Knowledge Complexity of Interactive Proof Systems – Goldwasser, Micali, et al. - 1989
516 The MD5 Message-Digest Algorithm – Rivest - 1992
273 Blind signatures for untraceable payments – Chaum
266 The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability – Chaum - 1988
209 An improved algorithm for computing logarithms over GF(p) and its cryptographic significance – Pohlig, Hellman - 1978
101 One way hash functions and DES – Merkle - 1989
100 Robust threshold DSS signatures – Gennaro, Jarecki, et al. - 1996
92 Secure computation – Micali, Rogaway - 1991
80 R.: ‘Message recovery for signature schemes based on the discrete logarithm problem – NYBERG, RUEPPEL - 1996
54 Provably secure blind signature schemes – Pointcheval, Stern - 1996
43 Single Term Off-line Coins – Ferguson - 1994
39 Privacy Protected Payments: Unconditional Payer and/or Payee Anonymity – Chaum - 1989
32 Network and Internetwork Security – Stallings - 1995
31 H.: ‘MetaMessage recovery and Meta-blind signature schemes based on the discrete logarithm problem and their applications – HORSTER, MICHELS, et al. - 1995
29 How to date blind signatures – Abe, Fujisaki - 1996
27 One Way Hash Functions and – Merkle - 1990
26 A Digital Multisignature Scheme Using Bijective Public-Key Cryptosystems – Okamoto - 1988
22 Blind signatures based on the discrete logarithm problem – Camenisch, Piveteau, et al. - 1995
19 Electronic voting schemes allowing open objection to the tally – Sako - 1994
14 Group-oriented (t, n) threshold digital signature scheme and digital multisignature – Harn - 1994
12 A secure and practical electronic voting scheme for real world environments – Juang, Lei - 1997
8 Partially blind threshold signatures based on discrete logarithm – Juang, Lei - 1999
7 A collision free secret ballot protocol for computerized general elections – Juang, Lei - 1996
6 New Blind Signatures Equivalent to Factorization – Pointcheval, Stern - 1997
6 R.A.Rueppel, "Message recovery for signature scheme based on the discrete logarithm problem," Eurocrypt 94 – Nyberg - 1994
5 Anonymous Channel and Authentication in Wireless Communications – Juang, Lei, et al. - 1999
4 received the B.S. degree in electrical engineering from National – He - 1997
4 PUB XX, "Digital Signature Standard," National Institute of Standards and – FIPS - 1993
3 Cryptanalysis of the blind signatures based on the discrete logarithm problem – Harn - 1995
2 PUB 180, Secure hash standard, National Institute of Standards and – FIPS - 1993
1 A practical secret voting scheme for large CHIN-LAUNG – Fujioka, Okamoto, et al. - 1992
1 Comment on Cryptanalysis of the blind signatures based on the discrete logarithm problem – Horster, Michels, et al. - 1995
1 On the (In) Security of Composed VSS Protocols," the rump session at Crypto'98 – Gennaro, Jarecki, et al. - 1998
1 PUB 180, "Secure hash standard, " National Institute of Standards and – FIPS - 1993