Abstract
In the marine wireless sensor networks, marine sensors collect multidimensional data such as temperature, salinity, dissolved oxygen and chlorophyll concentration in the ocean using a single hardware unit for further statistical analysis. Once these data are collected, they will be sent to the satellites or vessels for scientific information processing purposes, e.g. computing the mean, the variance and making regression analysis. Verifiable computation (VC) always allows the computationally weak parties to execute computing function operations over outsourced data sets or perform data sets towards outsourced functions to the cloud and still provides an efficient way to verify the returned result, which is an important issue in marine wireless sensor networks. However, the oceangoing voyage vessels always have low computational abilities, in such a way that they may outsource some computations (that need expensive computation costs by themselves) to the data center on the land (e.g. cloud). The computational results cannot be used directly since the cloud may return an incorrect outcome for some profits. Hence, we design a secure publicly VC protocol called \({\mathcal {DM}}{-}{\mathcal {PVC}}\), which supports both public delegation and public verifiability properties and tackles outsourced functions and outsourced data sets in a combined way. We additionally prove the proposed \({\mathcal {DM}}{-}{\mathcal {PVC}}\) secure in the random oracle model and evaluate its performance in the end.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The “\(\bot \)” considers that the verification algorithm reject the worker’s answer \(\sigma _\texttt {output}\).
- 2.
Here, we denote “
” as the related variables belonging to \(\overline{\textsc {sk}}_{\bar{\texttt {F}},\psi }\). Note that \(\textsc {sk}_{\texttt {F},\psi }\) and \(\overline{\textsc {sk}}_{\bar{\texttt {F}},\psi }\) are pair-wise independent since all related “xx” and “
” are independently and uniformly distributed. Here we omit the descriptions on the sampling process. - 3.
Similar to producing \(\overline{\textsc {sk}}_{\bar{\texttt {F}},\psi }\), we use “\(\overline{\mathrm {\texttt {xx}}}\)”-type variables to generate \(\overline{\textsc {ct}}_{\omega ,\texttt {G}}\).
” as the related variables belonging to 
” are independently and uniformly distributed. Here we omit the descriptions on the sampling process.References
D’Este, C., De Souza, P., Sharman, C., Allen, S.: Relocatable, automated cost-benefit analysis for marine sensor network design. Sensors 12(3), 2874–2898 (2012)
Wang, Z., Song, H., Watkins, D.W., Ong, K.G., Xue, P., Yang, Q., Shi, X.: Cyber-physical systems for water sustainability: challenges and opportunities. IEEE Commun. Mag. 53(5), 216–222 (2015)
Zhang, A., Yang, L., Zhang, S., Yu, J., Shu, Y.: Marine vehicle sensor network architecture and protocol designs for ocean observation. Sensors 12(1), 373–390 (2012)
Pengfei, H., Xing, K., Cheng, X., Wei, H., Zhu, H.: Information leaks out: attacks and countermeasures on compressive data gathering in wireless sensor networks. In: International Conference on Computer Communications (INFOCOM), pp. 1258–1266 (2014)
Huang, D., Zhao, D., Wei, L., Wang, Z., Yanling, D.: Modeling and analysis in marine big data: advances and challenges. Math. Probl. Eng. 1–13, 2015 (2015)
Mell, P., Grance, T.: The NIST Definition of Cloud Computing. Computer Security Division, Information Technology Laboratory, National Institute of Standards and Technology Gaithersburg (2011)
Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 111–131. Springer, Heidelberg (2011). doi:10.1007/978-3-642-22792-9_7
Backes, M., Fiore, D., Reischuk, R.M.: Verifiable delegation of computation on outsourced data. In: ACM Sigsac Conference on Computer and Communications Security, pp. 863–874 (2013)
Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465–482. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14623-7_25
Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: ACM Conference on Computer and Communications Security, pp. 501–512 (2012)
Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: efficient verification via secure computation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 152–163. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14165-2_14
Jiang, Y., Song, H., Wang, R., Ming, G., Sun, J., Sha, L.: Data-centered runtime verification of wireless medical cyber-physical system. IEEE Trans. Industr. Inform. PP(99), 1 (2016). doi:10.1109/TII.2016.2573762
Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 422–439. Springer, Heidelberg (2012). doi:10.1007/978-3-642-28914-9_24
Chung, K.-M., Kalai, Y., Vadhan, S.: Improved delegation of computation using fully homomorphic encryption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 483–501. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14623-7_26
Beimel, A.: Secure schemes for secret sharing and key distribution. Ph.D. thesis, Technion-Israel Institute of Technology, Faculty of Computer Science (1996)
Attrapadung, N., Imai, H.: Dual-policy attribute based encryption. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 168–185. Springer, Heidelberg (2009). doi:10.1007/978-3-642-01957-9_11
Giry, D.: Bluekrypt. https://www.keylength.com/en/
Akinyele, J.A., Garman, C., Miers, I., Pagano, M.W., Rushanan, M., Green, M., Rubin, A.D.: Charm: a framework for rapidly prototyping cryptosystems. J. Cryptograph. Eng. 3(2), 111–128 (2013)
Zhang, F.: http://student.seas.gwu.edu/~zfwise/crypto. Technical report
Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 84(5), 1234–1243 (2001)
Acknowledgement
We thank Ming Zeng and all anonymous reviewers. This work was supported by National Natural Science Foundation of China (61571191, 61572192, 61472142, 61402282, 61472249), the Science and Technology Commission of Shanghai Municipality (13JC1403502, 14YF1404200, 14YF1410400); Open Foundation of State Key Laboratory of Integrated Services Networks (ISN17-11) and International Science & Technology Cooperation & Exchange Projects of Shaanxi Province (2016KW-038).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Zhang, K., Wei, L., Li, X., Qian, H. (2017). Provably Secure Dual-Mode Publicly Verifiable Computation Protocol in Marine Wireless Sensor Networks. In: Ma, L., Khreishah, A., Zhang, Y., Yan, M. (eds) Wireless Algorithms, Systems, and Applications. WASA 2017. Lecture Notes in Computer Science(), vol 10251. Springer, Cham. https://doi.org/10.1007/978-3-319-60033-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-60033-8_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60032-1
Online ISBN: 978-3-319-60033-8
eBook Packages: Computer ScienceComputer Science (R0)