Abstract
Data are one of the most important sources of power that drives the world today. However, aggregating data is not an easy task with increasing legal regulations and concerns from users about their data privacy, and therefore incentives might be needed to encourage data sharing. In this paper, we present Labrador (LB), a system to handle the above problems. Our result demonstrates long-term privacy that reveals only an analytic result to the data analyst. An analytic task is delegated to clouds, which holds users’ homomorphically encrypted data. We develop a lightweight verifiable blind decryption technique over the linearly homomorphic encryption scheme to verify the final result. Thus, its verifiability and blindness rely on over-determined and under-determined systems, respectively. To support incentives in data sharing, we leverage smart contract to realize binding contracts between mutually distrusted parties. In the game theory model with a non-collusion assumption, Labrador is secure against any rational adversary. Our evaluation demonstrates that the computational overhead for the data analyst and the data owner is insignificant (i.e., only a few seconds and milliseconds, respectively).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Xu S M, Yang G M, Mu Y, et al. Secure fine-grained access control and data sharing for dynamic groups in the cloud. IEEE Trans Inform Forensic Secur, 2018, 13: 2101–2113
Shen J, Zhou T Q, Chen X F, et al. Anonymous and traceable group data sharing in cloud computing. IEEE Trans Inform Forensic Secur, 2018, 13: 912–925
Li J, Zhang Y H, Chen X F, et al. Secure attribute-based data sharing for resource-limited users in cloud computing. Comput Secur, 2018, 72: 1–12
Li R X, Shen C L, He H, et al. A lightweight secure data sharing scheme for mobile cloud computing. IEEE Trans Cloud Comput, 2018, 6: 344–357
Shao J, Lu R X, Lin X D. Fine-grained data sharing in cloud computing for mobile devices. In: Proceedings of International Conference on Computer Communications, Kowloon, 2015. 2677–2685
Yuan J W, Yu S C. Efficient public integrity checking for cloud data sharing with multi-user modification. In: Proceedings of International Conference on Computer Communications, Toronto, 2014. 2121–2129
Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theor, 2014, 6: 1–36
Smart N P, Vercauteren F. Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Proceedings of Public Key Cryptography, Paris, 2010. 420–443
Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (Standard) LWE. In: Proceedings of IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, 2011. 97–106
van Dijk M, Gentry C, Halevi S, et al. Fully homomorphic encryption over the integers. In: Advances in Cryptology—EUROCRYPT 2010. Berlin: Springer, 2010. 24–43
Gentry C, Halevi S, Smart N P. Fully homomorphic encryption with polylog overhead. In: Advances in Cryptology—EUROCRYPT 2012. Berlin: Springer, 2012. 465–482
Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology—CRYPTO 2013. Berlin: Springer, 2013. 75–92
Fan J F, Vercauteren F. Somewhat practical fully homomorphic encryption. IACR Cryptol ePrint Archive, 2012. https://eprint.iacr.org/2012/144
Liu Y, Luo Y, Zhu Y W, et al. Secure multi-label data classification in cloud by additionally homomorphic encryption. Inf Sci, 2018, 468: 89–102
Chen H, Laine K, Rindal P. Fast private set intersection from homomorphic encryption. In: Proceedings of ACM SIGSAC Conference on Computer and Communications Security, Dallas, 2017. 1243–1255
Lu W J, Kawasaki S, Sakuma J. Using fully homomorphic encryption for statistical analysis of categorical, ordinal and numerical data. In: Proceedings of the 24th Annual Network and Distributed System Security Symposium, San Diego, 2017
Zhang L, Li X-Y, Liu Y H, et al. Verifiable private multi-party computation: ranging and ranking. In: Proceedings of International Conference on Computer Communications, Turin, 2013. 605–609
Fiore D, Gennaro R, Pastro V. Efficiently verifiable computation on encrypted data. In: Proceedings of ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, 2014. 844–855
Elkhiyaoui K, Önen M, Azraoui M, et al. Efficient techniques for publicly verifiable delegation of computation. In: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, Xi’an, 2016. 119–128
Song W, Wang B, Wang Q, et al. Publicly verifiable computation of polynomials over outsourced data with multiple sources. IEEE Trans Inform Forensic Secur, 2017, 12: 2334–2347
Gennaro R, Gentry C, Parno B. Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Advances in Cryptology—CRYPTO 2010. Berlin: Springer, 2010. 465–482
Backes M, Fiore D, Reischuk R M. Verifiable delegation of computation on outsourced data. In: Proceedings of ACM SIGSAC Conference on Computer & Communications Security, Berlin, 2013. 863–874
Parno B, Howell J, Gentry C, et al. Pinocchio: nearly practical verifiable computation. In: Proceedings of IEEE Symposium on Security and Privacy, Berkeley, 2013. 238–252
Zhuo G Q, Jia Q, Guo L K, et al. Privacy-preserving verifiable data aggregation and analysis for cloud-assisted mobile crowdsourcing. In: Proceedings of International Conference on Computer Communications, San Francisco, 2016. 1–9
Zheng Q J, Xu S H, Ateniese G. VABKS: verifiable attribute-based keyword search over outsourced encrypted data. In: Proceedings of International Conference on Computer Communications, Toronto, 2014. 522–530
Canetti R, Riva B, Rothblum G N. Practical delegation of computation using multiple servers. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, Chicago, 2011. 445–454
van den Hooff J, Kaashoek M F, Zeldovich N. VerSum: verifiable computations over large public logs. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, 2014. 1304–1316
Castro M, Liskov B. Practical Byzantine fault tolerance and proactive recovery. ACM Trans Comput Syst, 2002, 20: 398–461
Cachin C, Kursawe K, Shoup V. Random oracles in Constantinople: practical asynchronous Byzantine agreement using cryptography. J Cryptol, 2005, 18: 219–246
Dong C Y, Wang Y L, Aldweesh A, et al. Betrayal, distrust, and rationality: smart counter-collusion contracts for verifiable cloud computing. In: Proceedings of ACM SIGSAC Conference on Computer and Communications Security, Dallas, 2017. 211–227
Xia Q, Sifah E B, Asamoah K O, et al. MeDShare: trust-less medical data sharing among cloud service providers via blockchain. IEEE Access, 2017, 5: 14757–14767
Xia Q, Sifah E B, Smahi A, et al. BBDS: blockchain-based data sharing for electronic medical records in cloud environments. Information, 2017, 8: 44
Maschler M, Solan E, Zamir S. Game Theory. Cambridge: Cambridge University Press, 2013
Acknowledgements
This work was supported by National Natural Science Foundation of China (Grant No. 61672300), National Natural Science Foundation of Tianjin (Grant No. 18ZXZNGX00140), National Natural Science Foundation for Outstanding Youth Foundation (Grant No. 61722203), Program for Young Changjiang Scholars in University of Ministry of Education of China, and Natural Science Foundation of China for Joint Fund Project (Grant No. U1936218).
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Guo, X., Li, J., Liu, Z. et al. Labrador: towards fair and auditable data sharing in cloud computing with long-term privacy. Sci. China Inf. Sci. 65, 152106 (2022). https://doi.org/10.1007/s11432-020-2940-8
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-020-2940-8