A Blind Signature Based on Discrete Logarithms Problem
碩士 === 國立臺北大學 === 電機工程研究所 === 97 === In 1983, D. Chaum first introduced the concept of blind signature. In the blind signature scheme, the requester requests the signer to sign on a blinded message. Then the requester derives the signature from the blind signature. When the requester releases the si...
Main Authors: | Yu-An Lin, 林昱安 |
---|---|
Other Authors: | Victor R. L. Shen |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/70796621509785740530 |
Similar Items
-
An Efficient Proxy Blind Signature Scheme with the Discrete Logarithm-based Trapdoor Hash
by: Kai-Lin Jeng, et al.
Published: (2006) -
The Design and Analysis of Digital Signatures Based on Factoring and Discrete Logarithm Problems
by: Shin-Yan Chiou, et al.
Published: (2004) -
A Fair Blind Signature Scheme Based on the Discrete Logarithms Modulo a Composite Number
by: Po-Yeah Chen, et al.
Published: (2003) -
Post-quantum signature algorithms based on the hidden discrete logarithm problem
by: A.A. Moldovyan, et al.
Published: (2018-11-01) -
On the Discrete Logarithm Problems
by: HUNG,YU-CHENG, et al.
Published: (2019)