跳到主要內容

臺灣博碩士論文加值系統

(44.220.44.148) 您好!臺灣時間:2024/06/18 13:57
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:曾偉城
論文名稱:模糊傳送之研究
指導教授:涂世雄涂世雄引用關係
學位類別:碩士
校院名稱:中原大學
系所名稱:電機工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2000
畢業學年度:88
語文別:英文
論文頁數:55
中文關鍵詞:模糊傳送秘密交換
外文關鍵詞:oblivious transfersecrets exchanging
相關次數:
  • 被引用被引用:0
  • 點閱點閱:103
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在本論文中,我們設計了數個模糊傳送協定。這些新協定包括了傳統模糊傳送協定、二選一模糊傳送協定、交互式模糊傳送協定及秘密交換協定。而我們設計的方法乃基於RSA系統、RABIN系統及離散對數的觀念。在傳統模糊傳送中,我們設計了三個新協定,其設計觀念乃分屬於上述所提,並且可根據此三個方法分別推演出新的二選一模糊傳送協定。我們所設計的交互式模糊傳送協定為上述所提二選一模糊傳送協定之延伸。
對於我們所設計的協定,均具有相當的安全性,並遵守各傳送協定之規則。
最後,我們提出兩個秘密交換協定,第一個是基於RSA系統,而第二個為基於RABIN系統並使用特殊二次剩餘方程式來產生伺服器秘密金匙。它們兩個都具有步驟簡單及解密快的優點。
我們相信本篇論文的研究結果,對於模糊傳送協定在未來的研究領域上將有所助益。

In this thesis, we design several new oblivious transfer protocols. These new protocols include fundamental oblivious transfer protocols, 1-2 oblivious transfer protocols, and extension of the fundamental and 1-2 oblivious transfer protocols.
For the fundamental oblivious transfer protocols, we design three new schemes which are based on RSA, Rabin’s cryptosystems and discrete logarithm, respectively. We also design three protocols for 1-2 oblivious transfer. These protocols are based on RSA, Rabin’s cryptosystems and discrete logarithm, individually. Each of them has high security that protects information against cryptanalyzing by the intruders.
Besides, we also design new protocols for the extension of fundamental oblivious transfer. They include the 1-t and the 2-t oblivious transfer, the interactive fundamental oblivious transfer and secrets exchanging for multi-user. In this thesis, two new protocols of the interactive fundamental oblivious transfer and two secrets exchanging protocols for multi-user are proposed based on RSA and Rabin’s cryptosystems, respectively. All of them have the advantages of simple process and quick decrypting.
There are four results provided in our thesis as follows:
1. We propose three new protocols for the fundamental oblivious transfer. 2. We propose three new protocols for the 1-2 oblivious transfer.
3. We extend some of these protocols to the 1-t, 2-t and present two new protocols for the interactive oblivious transfer.
4. We propose two secret exchanging protocols for multi-user.
It is believed that the results of our study in this thesis will be much helpful for the future research in the area of oblivious transfer protocols.

第一章 簡介 1
第二章 模糊傳送協定之背景與回顧 2
第三章 模糊傳送協定的新設計 3
第四章 結論與未來研究方向 4
英文附錄

[1] M. O. Rabin, “How to exchange secrets by oblivious transfer,” Technical Report TR-81, Harvard, 1981.
[2] S. Even, O. Goldreich, and A. Lempel, “A randomized protocol for signing contracts,” In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proc. CRYPTO ’82, pages 205-210. Plenum Press, 1983.
[3] S. Wiesner, “Conjugate coding,” Reprinted in SIGACT news, vol. 15, no. 1, 1983.
[4] A. C.-C. Yao, “How to generate and exchange secrets,” In Proc. 27th IEEE Symposium on Foundations of Computer Science (FOCS), pages 162-167, 1986.
[5] O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game or a completeness theorem for protocols with honest majority,” In Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218-229, 1987.
[6] O. Goldreich and R. Vainish, “How to solve any protocol problem — an efficiency improvement,” In C. Pomerance, editor, Advances in Cryptology: CRYPTO ’87, volume 293 of Lecture Notes in Computer Science, pages 73-86. Springer, 1988.
[7] J. Kilian, “Founding cryptography on oblivious transfer,” In Proc. 20th Annual ACM Symposium on Theory of Computing (STOC), pages 20-31, 1988.
[8] C. Crepeau, J. van de Graaf, and A. Tapp, “Committed oblivious transfer and private multi-party computations,” In Advances in Cryptology: Proceedings of Crypto ’95, volume 963 of Lecture Notes in Computer Science, pages 110-123. Springer-Verlag, 1995.
[9] M. Blum, “Three applications of the oblivious transfer: 1. Coin flipping by telephone, 2. How to exchange secrets, 3. How to send certified electronic mail,” Dept. EECS, University of California, Berkeley, Calif., 1981.
[10] M. O. Rabin, “Exchange of secrets,” Dept. of Applied Physics, Harvard University, Cambridge, Mass, 1981
[11] M. Blum, and M. O. Rabin, “How to send certified electronic mail,” Dept. EECS, University of California, Berkeley, Calif.,1981.
[12] G. Brassard, C. Crepeau, and M. Santha, “Oblivious transfer and intersecting codes,” IEEE Transactions on Information Theory, vol. 42, no. 6, pages 1769-1780. November 1996.
[13] E. Kushilevitz, S. Micali, and R. Ostrovsky, “Reducibility and completeness in multi-party private computations,” In Proc. 35th IEEE Symposium on Foundations of Computer Science (FOCS), pages 478- 489. 1994.
[14] D. Beaver, S. Goldwasser, “Multiparty computation with faulty majority,” In Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), pages 468- 473. 1989.
[15] C. Cachin, C. Crepeau, and J. Marcil, “Oblivious transfer with a memory-bounded receiver,” In Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), pages 493- 502. 1998.
[16] M. Bellare and S. Micali, “Non-interactive oblivious transfer and applications,” In G. Brassard, editor, Advances in Cryptology: CRYPTO ’89, volume 435 of Lecture Notes in Computer Science, pages 547-557. Springer, 1990.
[17] C. Crepeau, “Equivalence between two flavours of oblivious transfer,” In C. Pomerance, editor, Advances in Cryptology: CRYPTO ’87, volume 293 of Lecture Notes in Computer Science, pages 350-354. Springer, 1988.
[18] C. Bennett, G. Brassard, C. Crepeau, and M.-H. Skubiszewska, “Practical quantum oblivious transfer protocols,” In Advances in Cryptology: Proceedings of Crypto ’91, volume 576 of Lecture Notes in Computer Science, pages 351-366. Springer-Verlag, 1992.
[19] C. Crepeau, “Quantum oblivious transfer,” Journal of Modern Optics, pages 2445-2454. Dec. 1984.
[20] C. Crepeau and J. Kilian, “Achieving oblivious transfer using weekened security assumptions,” In Proc. 29th IEEE Symposium on Foundations of Computer Science (FOCS), 1998.
[21] C. Crepeau, “Efficient cryptographic protocols based on noisy channels,” In W. Fumy, editor, Advances in Cryptology: EUROCRYPTO ’97, volume 1233 of Lecture Notes in Computer Science, pages 306-317. Springer, 1997.
[22] 賴溪松, 韓亮, 張真誠, 近代密碼學及其應用, 松岡電腦圖書資料股份有限公司, 1994.
[23] W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. I-T 22, no. 6, pages 644-654. November 1976.
[24] L. Harn and H. Y. Lin, “Non-interactive oblivious transfer,” IEEE Electronics Letters, vol. 26 no. 10, pages 635-636, May 1990.
[25] L. Harn and H. Y. Lin, “An oblivious transfer protocol and its application for the exchange of secrets,” Advances in Cryptology: ASIACRYPTO ’91, pages 312-320.
[26] 楊吳泉, 現代密碼學入門與程式設計, 全華圖書科技, 1995.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top