Abstract
Despite the information theoretic security of Shamir Secret Sharing Scheme and the ideality of Verifiable Secret Sharing Scheme in ensuring the honesty of a dealer of the shared secret and the shared secret itself, the detection and removal of an adversary posing as shareholder is still an open problem due to the fact that most of the studies are computationally and communicationally complex. This paper proposes a verifiable secret sharing scheme using a simple subset sum theory in monitoring and removing compromised shareholder in a secure multiparty computation. An analysis shows that the scheme cost minimal computational complexity of O(n) on the worst-case scenario and a variable-length communication cost depending on the length of the subset and the value of n.
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
References
Thomas, G., Sibi, L., Maneesh, P.: A novel mathematical model for group communication with trusted key generation and distribution using shamir’s secret key and USB security. In: International Conference Communication and Signal Processing, pp. 435–438 (2015)
Alwen, J., Hirt, M., Maurer, U., Patra, A., Raykov, P.: Anonymous authentication with shared secrets. In: Aranha, D., Menezes, A. (eds.) Progress in Cryptology - LATINCRYPT 2014. LNCS, vol 8895, pp. 219–236. Springer, Cham (2015)
Van Ruitenbeek, E., Keefe, K., Sanders, W.H., Muehrcke, C.: Characterizing the behavior of cyber adversaries: the means, motive, and opportunity of cyberattacks. In: Networks, pp. 17–18 (2010)
Tavakolifard, M., Almeroth, K.C.: Trust 2.0: Who to believe in the flood of online data? In: Proceedings of International Conference Computer Network Communication, pp. 544–550 (2012)
Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp. 427–437 (1987)
Backes, M., Kate, A., Patra, A.: Computational verifiable secret sharing revisited. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). LNCS, vol. 7073, pp. 590–609 (2011)
Harn, L., Lin, C., Li, Y.: Fair secret reconstruction in (t, n) secret sharing. J. Inf. Secur. Appl. 23, 1–7 (2015)
Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium Foundations of Computer Science, pp. 21–23. IEEE, Portland (1985)
Nimmy, K.: Novel multi-server authentication protocol using secret sharing. In: International Conference on Data Mining and Advance Computing, pp. 1–6. IEEE, Ernakulam (2016)
Shukla, S., Sadashivappa, G.: Secure multi-party computation protocol using asymmetric encryption. In: 10th Asia Conference Information Security, pp. 780–785. IEEE, New Delhi (2014)
Wei, L., Ai, J., Liu, S.: A tightly secure multi-party-signature protocol in the plain model. In: 8th International Conference Biomedicine, Engineering and Informatics, pp. 672–677. IEEE, Shenyang (2016)
Pakniat, N., Noroozi, M., Eslami, Z.: Reducing multi-secret sharing problem to sharing a single secret based on cellular automata. IACR Cryptology ePrint Archive 642 (2017)
Aljumah, F., Soeanu, A., Liu, W.M., Debbabi, M.: Protocols for secure multi-party private function evaluation. In: 2015 1st International Conference Anti-Cybercrime, pp. 1–6. IEEE, Riyadh (2015)
Movatadid, L.: CSC 373 - algorithm design, analysis, and complexity - subset sum. In: Summer 2016, pp. 2–5 (2005)
Ren, S.Q., Meng, T.H., Yibin, N., Aung, K.M.M.: Privacy-preserved multi-party data merging with secure equality evaluation. In: Proceedings of International Conference Cloud Computing Research and Innovation, ICCCRI 2016, pp. 34–41 (2016)
Marwan, M., Kartit, A., Ouahmane, H.: Applying Secure multi-party computation to improve collaboration in healthcare cloud. In: International Conference System Collab, pp. 1–6. IEEE, Casablanca (2016)
Chen, K.: Efficient sum-to-one subsets algorithm for logic optimization. In: 29th ACM/IEEE Design Automation Conference, pp. 443–448. IEEE, CA (1992)
Zhou, D., Song, W., Ju, P.: Subset-sum based relay selection for multipath TCP in cooperative LTE networks. In: Globecom 2013 - Wireless Network Symposium Subset-Sum, pp. 4735–4740. IEEE, GA (2013)
Ristovski, Z., Mishkovski, I., Gramatikov, S., Filiposka, S.: Parallel implementation of the modified subset sum problem in CUDA. In: 22nd Telecommunication Forum Telfor, pp. 923–926. IEEE, Belgrade (2014)
Acknowledgment
The researchers would like to acknowledge the financial support provided by the Commission on Higher Education K to 12 Transition Program PMU, Quezon City, Philippines and San Carlos College, San Carlos City, Pangasinan.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Olalia, R.L., Sison, A.M., Medina, R.P. (2019). Subset Sum-Based Verifiable Secret Sharing Scheme for Secure Multiparty Computation. In: Unger, H., Sodsee, S., Meesad, P. (eds) Recent Advances in Information and Communication Technology 2018. IC2IT 2018. Advances in Intelligent Systems and Computing, vol 769. Springer, Cham. https://doi.org/10.1007/978-3-319-93692-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-93692-5_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93691-8
Online ISBN: 978-3-319-93692-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)