DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jinho | ko |
dc.contributor.author | Kim, Kwangjo | ko |
dc.contributor.author | Lee, Chulsoo | ko |
dc.date.accessioned | 2010-04-21T05:41:31Z | - |
dc.date.available | 2010-04-21T05:41:31Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | LECTURE NOTES IN COMPUTER SCIENCE, v.2288, pp.318 - 327 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/17862 | - |
dc.description.abstract | We propose an efficient and provably secure threshold blind signature scheme based on Okamoto-Schnorr blind signature. In our scheme, any t(t < n) out of n signers can generate a blind signature and any one can verify the signature using the same verification process used in Okamoto-Schnorr blind signature. New scheme can be used for blind signature-based voting systems with multiple administrators and secure electronic cash systems to prevent their abuse. We prove that our scheme is to be as secure as Okamoto-Schnorr’s blind signature scheme and more efficient than Juang et al.’s scheme [12]. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | Springer Verlag | - |
dc.title | An Efficient and Provably Secure Threshold Blind Signature | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 2288 | - |
dc.citation.beginningpage | 318 | - |
dc.citation.endingpage | 327 | - |
dc.citation.publicationname | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Kwangjo | - |
dc.contributor.nonIdAuthor | Kim, Jinho | - |
dc.contributor.nonIdAuthor | Lee, Chulsoo | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.