(3.215.180.226) 您好!臺灣時間:2021/03/06 16:18
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:蔡炯州
研究生(外文):Chiung-Chou Tsai
論文名稱:將離散對數簽章變換成具有可轉換特性的不可否認簽章之研究
論文名稱(外文):An Approach to Transform a Discrete Logarithm Based Ordinary Signature into a Convertible Undeniable Signature
指導教授:李維斌李維斌引用關係
指導教授(外文):Wei-Bin Lee
學位類別:碩士
校院名稱:逢甲大學
系所名稱:資訊工程所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
畢業學年度:95
語文別:英文
論文頁數:28
中文關鍵詞:可轉換的不可否認簽章不可否認簽章離散對數
外文關鍵詞:discrete logarithmundeniable signatureconvertible undeniable signature
相關次數:
  • 被引用被引用:0
  • 點閱點閱:139
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:16
  • 收藏至我的研究室書目清單書目收藏:0
傳統的數位簽章可以讓簽章者對於文件簽名,而公佈給驗證者來驗證此簽章是否為原簽章者所簽名過。不可否認簽章是一種非自身可驗證的數位簽章,不可否認簽章的特性在於只能在原簽章者的同意下才能進行驗證;另一方面,原簽章者將不能否認之前所簽過的不可否認簽章,假使原簽章者想要否認將會被察覺。在可轉換的特性,如果簽章者洩露一些秘密資訊,不可否認簽章將轉換成一般任何人都可以自身驗證的普通簽章。不可否認簽章加上可轉換的特性是非常吸引人的原因是因為簽章者可以隨時將不再重要的不可否認簽章,也就是不需要再經由簽章者同意才能驗證的不可否認簽章,讓每一個人都可以自身驗證。許多被提出的方法嘗試將可轉換的特性加入一個已知的不可否認簽章方法中,使得不可否認簽章能轉換成普通簽章;或者是提出一個全新的方法結構。然而,有許多傳統數位簽章方法結構已被提出且廣泛被應用,因此,在本篇論文中我們嘗試設計一個可雙向變換的模型,利用一個已存在且基於離散對數的普通簽章結構來架構我們的模型,使得任何基於離散對數的普通簽章都可以被變換成可轉換的不可否認簽章。
The concept of traditional digital signature let signer sign a message with his/her private key and the verifier could use signer’s public key to verify the validity of the signature whether was signed by the signer. Undeniable signature is a non-self-certified signature. It is only verified by the consent of the original signer. On the other hand, the original signer can’t deny the undeniable signature what he signed. It would be detected if the signer wants to deny. For the convertible property, the undeniable signature can be verified by anyone if some secrets are released by the original signer. The undeniable signature with convertible property is very attracted because the signer can decide which unimportant undeniable signature, which needn’t the original signer’s consent, could be verified by anyone. There are many proposed schemes try to introduce the convertible property into a known undeniable signature or design a complete new undeniable signature scheme. However, there are many excellent traditional signature were proposed and popularly applied. So in this paper, we try to design a dual transformation model. Using an existed discrete logarithm based signature scheme to construct our model, so that any discrete logarithm based signature can be transformed into a convertible-undeniable signature.
誌謝
中文摘要
Abstract
Table of Contents
Chapter 1 Introduction
Chapter 2 Preliminary
Definition 1:(Ordinary signature)
Definition 2:(Undeniable signature)
Definition 3:(TF function)
Definition 4:(CF function)
Chapter 3 Our model
3.1 TF function
3.2 Convertible undeniable signature generation
3.3 CF function
3.4 Ordinary signature verification
Chapter 4 Security Analysis
4.1 TF function security
4.2 Requirement of transformation
4.3 Unforgeability
Chapter 5 Discussion
5.1 Generalization capability
5.2 Comparison
Chapter 6 Example
6.1 TF function
6.2 Convertible undeniable signature generation
6.3 CF function and verification
Chapter 7 Conclusion
References
[1]J. Boyar, D.Chaum, and I. Damgard, T. Pedersen, “Convertible undeniable signatures,” Advances in Cryptology ––Crypto’90, Lecture Notes in Computer Science, 1991, pp. 189–205.
[2]D. Chaum, “Zero-knowledge undeniable signature”, Advances in Cryptology –– Crypto’90, Lecture Notes in Computer Science, Springer-Verlag, 1990, pp. 458 – 464
[3]D. Chaum and H. V. Antwerpen, “Undeniable signatures,” Advances in Cryptology –– Crypto’89, 1989, pp. 212–217.
[4]I. Damgard and T. Pedersen. “New convertible undeniable signature schemes”, Advances in Cryptology --- EUROCRYPT ''96, Lecture Notes in Computer Science 1070, pp. 372--386, SpringerVerlag, 1996
[5]T. ElGamal, “A public key cryptosystem and signature scheme based on discrete logarithm,” IEEE Transactions on Information Theory, Vol. IT-31, No. 4, 1985, pp. 469-472.
[6]L. Harn and Y. Xu, “Design of generalized ElGamal type digital signature scheme based on discrete logarithm,” Electronics Letters, Vol. 30, No. 24, 1994, pp. 2025-2026.
[7]P. Horster and H.-J. Knobloch, “Discrete Logarithm based protocols”, Lecture Notes in Computer Science 547, Advances in Cryptology –– Eurocrypt ''91, Berlin: Springer Verlag, 1992, pp. 399 - 408.
[8]L. Jihong and X. Guozhen, “A Convertible Undeniable Signature Scheme With Perfectly Zero-Knowledge Feature”, Journal of China Institute of communications, vol.20 No.1 1999
[9]N. Y. Lee and P. H. Ho, “Convertible Undeniable Signature with Subliminal Channels,” Applied Mathematics and Computation, Vol.158, No.1, 2004, pp. 169–175.
[10]M. Michels, H. Petersen, and P. Horster, “Breaking and Repairing a Convertible Undeniable Signature Scheme,” ACM, 1996, pp. 148 - 152.
[11]M. Michels and M. Stadler, “Efficient Convertible Undeniable Signature Schemes”, Proceeding of 4th International Workshop on Selected Areas in Cryptography( SAC’97), 1997, pp. 231-244
[12]B. Schneier, “Applied Cryptography,” John Wiley & Sons, 2nd ed., New York, 1996.
[13]C. Schnorr, “Efficient identification and signatures for smart cards”, Proceedings of Crypto89, Springer-Verlag, 1990, pp.235-251.
[14]V. Shoup, “A Composition Theorem for Universal One-way Hash Functions,” Advances in Cryptology –– EUROCRYPT 2000, Springer-Verlag, 2000, pp. 445-452.
[15]S. H. Yun and T. Y. Kim, “Convertible Undeniable Signature Scheme,” High Performance Computing on the Information Superhighway, HPC Asia_97, 28 April - 2 May, 1997, pp. 700–703.
[16]S. H. Yun and H. W. Lee, “The Efficient Multipurpose Convertible Undeniable Signature Scheme”, Knowledge-Based Intelligent Information & Engineering Systems, Lecture Notes in Computer Science, Springer-Verlag, 2005, pp. 325-331
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
1. 林昭賢(1995)。用愛重整校園倫理。教師天地,74,15-18。
2. 林孟皇(2001)。論學校本位管理組織法制之建構(上)。教育研究月刊,83,94-106。
3. 何青蓉(1996)。成人學習研究的發展趨勢與幾個帶發展的論點。成人教育,34,9-17。
4. 吳政憲(2001)。教師在職進修的新趨勢─學校本位的教師專業發展。研習資訊,18(1),29-44。
5. 胡夢鯨﹙1996a﹚。成人教育學習理論模型論成人教育專業化人才的培育。成人教育雙月刊,29,12-20。
6. 胡夢鯨﹙1998b﹚。 學習社會:世界變遷與教育大趨勢。成人教育雙月刊,44,17-22。
7. 高義展(2000)。淺談學校行政與教師專業自主的調適。教育資料與研究,32,50-55。
8. 陳乃林(1998)。終身學習論析。成人教育,41,36-41。
9. 陳嘉彌(1997)。教師參與在職進修動機取向與其接受創新程度間之關係研究。教育研究資訊,5,45-62。
10. 張博堯﹙1996﹚。永續經營,終身學習。管理雜誌,269,117-119。
11. 黃明月(2000)。成人經驗學習理論之探討。社會教育學刊,29,35-56。黃政傑(1996)。從課程的角度看教師專業發展。教師天地,83,13-17。
12. 黃富順﹙1985﹚。成人教育的學習特性。社教雙月刊,10,52-68。
13. 詹志禹、彭秀玉(2000)。教學導師制的實施困難與解決策略。教育資料與研究,36,12-15。
14. 簡建忠﹙1995﹚。我國成人參與學習的動機與阻礙因素之探討。人力資源學報,5,63-75。
15. 蕭英勵(2000)。建立教師個人的教學風格:以一位有創意的教師為例。教育資料與研究,32,56-61。
 
系統版面圖檔 系統版面圖檔