A secure delegation scheme of large polynomial computation in multi-party cloud

被引：18

作者：

Guo, Shu ^{[1
]}

Xu, Haixia ^{[1
]}

机构：

[1] Institute of Information Engineering, Chinese Academy of Science, Beijing

来源：

International Journal of Grid and Utility Computing | 2015年 / 6卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Cloud; Delegating computation; Secret sharing; Unchanged threshold;

D O I：

10.1504/IJGUC.2015.066387

中图分类号：

学科分类号：

摘要：

Cloud computing is becoming widely used both in academia and industry and one of the most important applications is delegating computation. A computationally weak client delegates tasks to one or more workers in cloud, and this is called delegation computation. Delegation computation has high security requirements, and it needs to ensure that the information of the client would not be leaked and the computation will be computed correctly. What's more, the clients can verify the result after computation. This paper presents a delegation protocol and it allows the client to delegate a large polynomial to more than one worker while keeping privacy and correctness. In this paper, the workers make computations directly on the shares from the client, and keep the threshold unchanged. This protocol has these advantages: the protocol keeps privacy of the original input; the workers have no interaction with each other during the execution; the protocol keeps the threshold unchanged. Copyright © 2015 Inderscience Enterprises Ltd.

引用

页码：1 / 7

页数：6

共 24 条

[1]

Atallah M.J., Li J., Secure outsourcing of sequence comparisons, International Journal of Information Security, 4, 4, pp. 277-287, (2005)

[2]

Atallah M.J., Pantazopoulos K.N., Rice J.R., Spafford E.H., Secure outsourcing of scientific computations, Advances in Computers, 54, pp. 216-272, (2001)

[3]

Belenkiy M., Chase M., Erway C.C., Jannotti J., Kupcu A., Lysyanskaya A., Incentivizing outsourced computation, NetEcon'08, pp. 85-90, (2008)

[4]

Benjamin D., Atallah M.J., Private and cheating-free outsourcing of algebraic computations, Proceedings of 6th Conference on Privacy, Security, and Trust (PST), pp. 240-245, (2008)

[5]

Cloud Security Alliance, Security Guidance for Critical Areas of Focus in Cloud Computing, (2009)

[6]

Cramer R., Damgard I., Maurer U., General secure multi-party computation from any linear secret-sharing scheme, EUROCRYPT, 1807, pp. 316-334, (2000)

[7]

Gennaro R., Gentry C., Parno B., Non-interactive verifiable computing: Outsourcing computation to untrusted workers, CRYPTO 2010, 6223, pp. 465-482, (2010)

[8]

Gennaro R., Rabin M.O., Rabin T., Simplified VSS and fast-track multiparty computations with applications to threshold cryptography, Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 101-111, (1998)

[9]

Gentry C., Fully homomorphic encryption using ideal lattices, Proceedings of STOC, pp. 169-178, (2009)

[10]

Gentry C., Computing arbitrary functions of encrypted data, Communications of the ACM, 53, 3, pp. 97-105, (2010)

← 1 2 3 →