DOI
stands for Digital Object Identifier
(
D
igital
O
bject
I
dentifier
)
,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.
Using DOI as a persistent link
To create a persistent link, add「http://dx.doi.org/」
「
http://dx.doi.org/
」
before a DOI.
For instance, if the DOI of an article is
10.5297/ser.1201.002
, you can link persistently to the article by entering the following link in your browser:
http://dx.doi.org/
10.5297/ser.1201.002
。
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.
Cite a document with DOI
When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.
DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI Registration ( doi.airiti.com ) 。
An Efficient E-cash Scheme Based on Trapdoor Hash Function
陳皇佑 , Masters Advisor:楊伏夷
繁體中文
電子現金交易系統 ; 盲簽章 ; 行動裝置 ; 有後門的赫序雜湊運算 ; E-cash system ; Mobile ; Trapdoor hash function ; Blind signature


- [1]D. Chaum, “Blind Signatures for Untraceable Payments”, Advances in Cryptology - CRYPTO’82, Springer- Verlag, pp.199-203.
連結: - [2]C. I. Fan, W. K. Chen and Y. S. Yeh , “Date Attachable Electronic Cash”, Computer Communications, Vol. 23, No. 4, pp. 425-428, 2000.
連結: - [3]C. C. Chang and Y. P. Lai (2003), “A flexible Date-attachment Scheme on E-cash”, Computers & Security, Vol. 22, No. 2, pp. 160-166.
連結: - [4]W. S. Juang (2007), “D-Cash: A Flexible Pre-paid E-cash Scheme for Date-attachment”, Electronic Commerce Research and Applications, Vol. 6, No. 1, pp. 74-80.
連結: - [6]A. Shamir and Y. Tauman, “Improved online / offline signature schemes,” Advances in Cryptology-CRYPTO’01, LNCS 2139, pp. 355-367, 2001.
連結: