A Study on The Fail-Stop Blind Signature-Base On Discrete Logarithems
碩士 === 國防管理學院 === 國防資訊研究所 === 96 === Susilo, Safavi-Naini and Pieprzyk presented two RSA-based fail-stop signature schemes with and withouta trusted dealer in 1999. Based on Susilo et al.’s scheme, Dr. Lin-Chuan Wu presented fail-stop blind signature scheme with trusted dealer. The fail-stop blind s...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/45708988335224399581 |
Summary: | 碩士 === 國防管理學院 === 國防資訊研究所 === 96 === Susilo, Safavi-Naini and Pieprzyk presented two RSA-based fail-stop signature schemes with and withouta trusted dealer in 1999.
Based on Susilo et al.’s scheme, Dr. Lin-Chuan Wu presented fail-stop blind signature scheme with trusted dealer. The fail-stop blind signature scheme combines the advantages of both fail-stop signature and blind signature. Wu’s scheme can provide “proof of forgery” for signers and guarantee “anonymity” for the participants/requesters. Wu gave proof to show that the proposed scheme satisfies the conditions of fail-stop signature and blind signature. But Wu’s scheme itself is built on the original blind signature mechanism and hence inherits the shortcoming of blind signature. Due to the anonymity property, Wu’s scheme can not trace the sender and hence may be misused, such as laundry of electronic cash.
Improving Wu’s fail-stop blind signature scheme with fair blind signature, this study try to solve the above mentioned problem using discrete algorithm.
|
---|