期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

可验证的安全矩阵行列式计算云外包协议 被引量：2

Verifiable and Secure Protocol for Outsourcing Matrix Determinant Computation to Malicious Cloud
下载PDF
导出
摘要 云计算外包越来越流行的同时也带来了新的安全问题和挑战:输入/输出数据的隐私性和结果的可验证性。本文围绕云计算环境下的安全矩阵行列式计算外包展开研究,构建一个适用于大矩阵行列式计算的可验证的安全云外包协议,在客户端将原始矩阵盲化加密后传送到云服务器端执行计算,云服务器将计算结果和验证值返回给客户端进行解密和验证。理论分析表明,在恶意云的安全模型下协议满足正确性、输入/输出私密性、高效性和结果可验证性。 Computation outsourcing to the cloud has become a popular application .This computing paradigm brings in some new security concerns and challenges , such as input/output privacy and result verifiability .A protocol is designed to enable secure , robust cheating resistant , and efficient outsourcing of matrix determinant computation to a malicious cloud .Client encrypts the o-riginal matrix and then transfers it to cloud server to compute .Analysis shows that the proposed protocol is correct , secure, and robust cheating resistant .Extensive theoretical analysis also shows its high-efficiency .
作者 申银杰
机构地区 北京工业大学计算机学院
出处 《计算机与现代化》 2015年第5期103-106,共4页 Computer and Modernization
基金 国家自然科学基金资助项目(61272044)
关键词 云计算 安全计算外包 行列式计算 cloud computation secure computation outsource determinant computation
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献16

  • 1Martinez Gregorio, Zeadally Sherali, Chao Han-Chieh. Ed- itorial: Cloud computing service and architecture models [ J]. Information Sciences, 2014,258:353-354.
  • 2Lloret Jaime, Garcia Miguel, Tomas Jesus, et al. Archi- tecture and protocol for intercloud communication [ J ]. In- formation Sciences, 2014,258:434-451.
  • 3Armbrust Michael, Fox Armando, Griffith Rean, et al. A view of cloud computing[J]. Communications of the ACM, 2010,53(4) :50-58.
  • 4Vera-del Campo Juan, Pegueroles Josep, HernOndez-Serra- no Juan, et al. DocCloud: A document recommender sys- tem on cloud computing with plausible deniability [ J ]. In- formation Sciences, 2014,258:387-402.
  • 5Hohenberger S, Lysyanskaya A. How to securely outsource cryptographic computations [ C ]// Proceedings of the 2nd Theory of Cryptography Conference. 2005:264-282.
  • 6Atallah M J, Pantazopoulos K N, Rice J R, et al. Secure outsourcing of scientific computations [ J ]. Advances in Computers, 2002,54:215-272.
  • 7Atallah M J, Li Jiangtao. Secure outsourcing of sequence comparisons [ J ]. International Journal of Information Secu- rity, 2005,4(4) :277-287.
  • 8Benjamin D, Atallah M J. Private and cheating-free out- sourcing of algebraic computations [ C ]// Proceedings of the 6th Annual Conference on Privacy, Security and Trust ( PST' 08). 2008:240-245.
  • 9Paillier P. Public-key cryptosystems based on composite degree residuosity classes[ C]//Proceedings of the EURO- CRYPT' 99. 1999:223-238.
  • 10Even S, Goldreich O, Lempel A. A randomized protocol for signing contracts [ J ]. Communications of the ACM, 1985,28 (6) :637-647.

二级参考文献35

  • 1赫尔 M.群论[M].裘光明,译.北京:科学出版社,1981:60.
  • 2Sun Microsystems, Inc. Building customer trust in cloud computing with transparent security. 2009. https://www.sun. com/offers/det ails/sun_transparency.xml.
  • 3Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. Maryland, 2009. 169-178.
  • 4Gentry C. Toward basing fully homomorphic encryption on worst-case hardness. In: Proceedings of the 30th Annual Cryptology Conference. Santa Barbara, 2010. 116-137.
  • 5van Dijk M, Gentry C, Halevi S, et al. Fully homomorphic encryption over integers, In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Riviera, 2010. 24-43.
  • 6Smart N P, Vercauteren F. Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Pro- ceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography. Paris, 2010. 420-443.
  • 7Stehle D, Steinfeld R. Faster fully homomorphic encryption. In: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security. Singapore, 2010. 377-394.
  • 8Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Riviera, 2010. 1-23.
  • 9Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption (standard) LWE. In: IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). Palm Springs, 2011. 97-106.
  • 10Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Proceedings of the 31st Annual Cryptology Conference. Santa Barbara, 2011. 501-521.

共引文献23

同被引文献7

引证文献2

二级引证文献7

计算机与现代化
2015年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部