Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.advisorGwo-boa Horngen_US
dc.contributor.authorLin, Chi-Hongen_US
dc.identifier.citation[1] L.M. Adleman and J. DeMarrais, “A subexponential algorithm for discrete logarithms over all finite fields,” Advances in Cryptology - Crypto'93 Proceedings, LNCS 773, pp. 147-158, 1994. [2] M. Armbrust, A. Fox, R. Griffith et al. “Above the Clouds: A Berkeley View of Cloud Computing.” UCB/EECS-2009-28, EECS Department, University of California, Berkeley, 2009. [3] G.B. Agnew, R.C. Mullin, and S.A. Vanstone, Fast exponentiation in GF(2n), in Advances in Cryptology-Eurocrypt '88, Lecture Notes in Computer Science, Volume 330, Springer-Verlag, Berlin, 1988, pp. 251-255 [4] D. Benjamin and M. J. Atallah, “Private and cheating-free outsourcing of algebraic computations,” in Proc. of 6th Conf. on Privacy, Security,and Trust (PST), 2008, pp. 240-245. [5] E. Brickell, D. M. Gordon, K. S. McCurley and D. Wilson, “Fast exponentiation with precomputation,” Advances in Cryptology - Eurocrypt'92 Proceedings, LNCS 658, pp. 200-207, 1993. [6] J. Burns and C. J. Mitchell, “Parameter selection for server-aided RSA computation schemes,” IEEE Transactions on Computers, Vol. 43, No. 2, pp. 163-174, 1994. [7] P. B'eguin and J-J. Quisquater, “Fast server-aided RSA signatures secure against active attacks,” Advances in Cryptology - Crypto'95 Proceedings, LNCS 963, pp. 57-69, 1995. [8] R. Buyya, C.S. Yeo, S. Venugopal, J. Broberg, and I. Brandic: Cloud Computing and Emerging IT Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility. Future Generation Computer Systems, 25(6): 599-616, Elsevier Science, Amsterdam, The Netherlands, June 2009. [9] D. Chaum, “Blind signatures for untraceable payments,” Advances in Cryptology - Crypto''82 Proceedings, pp. 199-203, 1982. [10] Y. Chen, W. Chen, Y. Mu, X. Chen, and M. Liu,“Server-Aided Public Key Generation Protocols on Low-power Devices for Ad-hoc Networks”, the 6th International Conference on ITS Telecommunications (ITST2006), IEEE Press, pp.710-714, 2006. [11] R. Canetti, B. Riva, G. N. Rothblum, “Refereed Delegation of Computation,” The Check Point Institute for Information Security 2011. [12] R. Canetti, B. Riva, and G. Rothblum. “Verifiable computation with two or more clouds.” In Workshop on Cryptography and Security in Clouds, 2011. [13] T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,“ IEEE Transactions on Information Theory, Vol. 31, No. 4, pp. 469-472, 2002. [14] U. Feige and J. Kilian, Making games short (extended abstract), STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, ACM, 1997, pp. 506-516. [15] R. Gennaro, C. Gentry, and B. Parno. “Non-interactive veriable computing: Outsourcing computation to untrusted workers.” In CRYPTO''10, volume 6223 of LNCS, pages 465-482. Springer, 2010. [16] S. Hohenberger and A. Lysyanskaya, “How to securely outsource cryptographic computations,” Theory of Cryptography, LNCS 3378, pp.264-282, 2005. [17] G. Horng, “Secure server-aided RSA signature computation protocol for smart cards,” Journal of Information Science and Enginearing, Vol. 16, No. 6, pp. 847-855, 2000. [18] S. Kawamura and A. Shimbo, “Fast server-aided secret computation protocols for modular exponentiation,” IEEE Journal on Selected Areas of Communications, Vol. 11, No. 5, pp. 778-784, 1993. [19] C. H. Lim and P. J. Lee, “Server(prover/signer)-aided verification of identify proofs and signatures,” Advances in Cryptology - EuroCrypt'95 Proceedings, LNCS 921, pp. 64-78, 1995. [20] C. H. Lim and P. J. Lee, “Security and performance of server-aided RSA computation protocols,” Advances in Cryptology - Crypto'95 Proceedings, LNCS 963, pp. 70-83, 1995. [21] T. Matsumoto, K. Kato and H. Imai, “Speeding up secret computation with insecure auxiliary devices,” Advances in Cryptology - Crypto'88 Proceedings, LNCS 403, pp. 497-506, 1989. [22] NIST, “Proposed Federal Information Processing Standard foe Digital Signature Standard (DSS),” Federal Register, Vol.56, No.169, pp.42980-42982, Aug.30, 1991. [23] NIST, “The Digital Signature Standard Proposed by NIST,” Commun. ACM, Vol.35, No.7, pp.36-40, July 1992. [24] D. Nurmi et al., “The Eucalyptus Open-Source Cloud-Computing System,” Cloud Computing and Applications 2008 (CCA 08), 2008; [25] P. Q. Nguyen, I. E. Shparlinski, and J. Stern. “Distribution of modular sums and the security of server aided exponentiation.” In Proceedings of the Workshop on Comp. Number Theory and Crypt., pages 1-16, 1999. [26] A. Odlyzko, “Discrete logarithms: The past and the future,” Designs, Codes and Cryptography, Vol. 19, No. 2-3, pp. 129-145, 2000. [27] J-J. Quisquater and M. De Soete, Speeding up smart card RSA computation with insecure coprocessors. In Proc. Smart Card 2000, (1991) pp. 191-197. [28] R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, Vol. 21, No. 2, pp. 120-126, 1978. [29] P. de Rooij, “On Schnorr's preprocessing for digital signature schemes,” Journal of Cryptology, Vol. 10, No. 1, pp. 1-16, 1997. [30] C. P. Schnorr, “Efficient signature generation by smart cards. Journal of Cryptology,” Vol. 4, ISSUE 3, pp. 161-174, 1991. [31] O. Schirokauer, D. Weber and Th. F. Denny. “Discrete logarithms: the effectiveness of the index calculus method,” Proceedings Algorithmic Number Theory II, LNCS 1122, pp. 337-361, 1996. [32] M. Van Dijk, D. Clarke, B. Gassend, G.E. Suh and S. Devadas, “Speeding up Exponentiation using an Untrusted Computational Resource,” Designs, Codes and Cryptography, Vol. 39, No. 2, pp. 253-273, 2006. [33] Zhiwei Wang “A new construction of the server-aided verification signature scheme”, Mathematical and Computer Modelling, 2011. [34] C. Wang, K. Ren, and J. Wang, “Secure and practical outsourcing of linear programming in cloud computing,” in Proc. of IEEE INFOCOM, 2011, to appear.zh_TW
dc.description.abstract在許多常見的密碼系統或簽章中廣為運用指數運算。然而,指數運算所需的計算量比起其他運算相對的多。這使得如何加速指數運算成為重要且受注意的議題。 在某些指數加速運算方法中會使用輔助處理器或伺服器來協助運算。一般來說,輔助處理器或伺服器應該假設是可信任的但實際上這種假設是不切實際的,因此產生了對於安全的伺服器輔助指數加速運算的需要。 本文我們將Van Dijk等人的協定延伸,提出基於仲裁式委任計算(Delegation of Computation)架構的伺服器輔助指數運算加速協定。我們的協定可允許部份伺服器出錯以及我們的協定屬於無條件安全且比Van Dijk等人來的有效率。zh_TW
dc.description.abstractExponentiation is a commonly used operation in most of cryptosystems and signature schemes. How to speed up exponentiation becomes important. In some of the speeding up exponentiation protocols, they use an auxiliary processor or a server to aid the whole computing process. It is common to assume that the auxiliary processor or the server would be trusted, but this assumption is unrealistic in practice. Therefore, we need a secure server-aided speeding up exponentiation protocol. In this thesis, we extend Van Dijk et al.''s protocol, and propose the secure speeding-up exponentiation protocols based on Refereed Delegation of Computation. Taking the factor of fault tolerance into consideration, our protocol allows a number of dishonest servers. Our protocol is unconditional secure and more efficient than Van Dijk et al.''s.en_US
dc.description.tableofcontents致謝 I 摘要 II Abstract III 圖目錄 VI 表目錄 VII 第一章 緒論 1 1.1 研究動機與目的 1 1.2 研究貢獻 5 1.3 論文架構 6 第二章 基礎知識 7 2.1 square-and-multiply演算法 7 2.2 位元表示法 7 2.3 RSA的數位簽章機制 8 2.4 伺服器輔助RSA簽章協定 9 2.5 仲裁式委任計算(RDoC) 10 第三章 相關研究 11 3.1 Van Dijk等人的指數運算加速協定 11 3.1.1 Model 11 3.1.2 Fixed Base-Variable Exponent 指數運算協定 12 3.2 Horng的伺服器輔助RSA簽章協定 14 第四章 基於仲裁式委任計算的指數運算加速協定 16 4.1 Model 16 4.2 我們的方法 17 4.2.1 基本法 17 4.2.2 進階深度法 20 4.3 正確性分析 22 4.4 安全性分析 23 4.5 計算量分析 26 第五章 討論與比較 29 第六章 結論與未來目標 31 參考文獻 32zh_TW
dc.subjectTzung-Her Chenen_US
dc.subjectKuen-Fang Jiaen_US
dc.subjectHung-Min Sunen_US
dc.subject仲裁式委任計算(Delegation of Computation)zh_TW
dc.titleSpeeding-up Exponentiation Protocols Based on Refereed Delegation of Computationen_US
dc.typeThesis and Dissertationzh_TW
item.openairetypeThesis and Dissertation-
item.fulltextno fulltext-
Appears in Collections:資訊科學與工程學系所
Show simple item record

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.