#### Forward-secure blind signature scheme based on the strong RSA Assumption

Cited 0 time in Cited 0 time in
• Hit : 335
DC FieldValueLanguage
dc.contributor.authorDang Nguyen Duc-
dc.date.accessioned2011-12-30-
dc.date.available2011-12-30-
dc.date.issued2003-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392309&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/55227-
dc.description학위논문(석사) - 한국정보통신대학원대학교 : 공학부, 2003, [ ix, 42 p. ]-
dc.description.abstractThese days, with the advancement and popularity of the Internet and information technology, electronic services ($\emph{e.g.}$banking, commercial transactions, etc.) become inevitable. One of key enabling technologies for such services is to adapt cryptography which is crucial for security issues. Unfortunately, cryptography will work only if a piece of information ($\emph{e.g. secret key}$) is kept secret from unauthorized entities. However, in practice, it is difficult to guarantee that requirement. When the secret key is revealed, all security goals are lost. And we call this the key exposure problem. Blind signature is an interesting cryptographic protocol. It is an extension of ordinary digital signature and has applications in electronic cash, electronic voting, $\emph{etc}$. It turns out that key exposure problem is very serious in blind signature. For example, in electronic cash systems, key exposure problem is very severe since money is directly involved. Forward security is the first security notion addressing the key exposure issue. Roughly speaking, forward secrecy protects validity of the past usage even if the current secret key is compromised. In this thesis, we investigate the key exposure problem in blind signature (with application to electronic cash in mind). We then propose a blind signature scheme which guarantees forward secrecy. Our scheme is constructed from the provably secure Okamoto-Guillou-Quisquater (OGQ for short) blind signature scheme. Using forking lemma proposed by Pointcheval and Stern, we can show equivalence between existence of a forger and feasibility of solving the strong RSA problem. We also found that our scheme introduces no significant communication overhead comparing with OGQ scheme.eng
dc.languageeng-
dc.publisher한국정보통신대학교-
dc.subjectRSA Assumption-
dc.subjectSignature Scheme-
dc.titleForward-secure blind signature scheme based on the strong RSA Assumption-
dc.typeThesis(Master)-
dc.identifier.CNRN392309/225023-
dc.description.department한국정보통신대학원대학교 : 공학부, -
dc.identifier.uid020014084-
dc.contributor.localauthorKim, Kwang-Jo-
dc.contributor.localauthor김광조-
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.