Please use this identifier to cite or link to this item:
Speeding-up Exponentiation Protocols Based on Refereed Delegation of Computation
仲裁式委任計算（Delegation of Computation）
|引用:|| 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.  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.  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  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.  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.  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.  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.  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.  D. Chaum, “Blind signatures for untraceable payments,” Advances in Cryptology - Crypto''82 Proceedings, pp. 199-203, 1982.  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.  R. Canetti, B. Riva, G. N. Rothblum, “Refereed Delegation of Computation,” The Check Point Institute for Information Security 2011.  R. Canetti, B. Riva, and G. Rothblum. “Verifiable computation with two or more clouds.” In Workshop on Cryptography and Security in Clouds, 2011.  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.  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.  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.  S. Hohenberger and A. Lysyanskaya, “How to securely outsource cryptographic computations,” Theory of Cryptography, LNCS 3378, pp.264-282, 2005.  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.  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.  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.  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.  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.  NIST, “Proposed Federal Information Processing Standard foe Digital Signature Standard (DSS),” Federal Register, Vol.56, No.169, pp.42980-42982, Aug.30, 1991.  NIST, “The Digital Signature Standard Proposed by NIST,” Commun. ACM, Vol.35, No.7, pp.36-40, July 1992.  D. Nurmi et al., “The Eucalyptus Open-Source Cloud-Computing System,” Cloud Computing and Applications 2008 (CCA 08), 2008; www.cca08.org/papers.php.  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.  A. Odlyzko, “Discrete logarithms: The past and the future,” Designs, Codes and Cryptography, Vol. 19, No. 2-3, pp. 129-145, 2000.  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.  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.  P. de Rooij, “On Schnorr's preprocessing for digital signature schemes,” Journal of Cryptology, Vol. 10, No. 1, pp. 1-16, 1997.  C. P. Schnorr, “Efficient signature generation by smart cards. Journal of Cryptology,” Vol. 4, ISSUE 3, pp. 161-174, 1991.  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.  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.  Zhiwei Wang “A new construction of the server-aided verification signature scheme”, Mathematical and Computer Modelling, 2011.  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.|
本文我們將Van Dijk等人的協定延伸，提出基於仲裁式委任計算（Delegation of Computation）架構的伺服器輔助指數運算加速協定。我們的協定可允許部份伺服器出錯以及我們的協定屬於無條件安全且比Van Dijk等人來的有效率。|
Exponentiation 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.
|Appears in Collections:||資訊科學與工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.