Abstract
In Shamir’s (k, n)-threshold secret-sharing scheme, a secret is divided into n shares, and the secret is recovered from k shares. When this scheme is applied to a server system, the n shares are distributed to n servers. Therefore, the secret can be restored by collecting the shares from k servers. In the case of two secrets, the latter are distributed over n servers such that each server consists of one share of each secret. Secrecy addition is performed by the addition of the two shares on each server. The combined secret can be restored through the added shares from k servers. Therefore, secrecy addition is realized by using k servers. However, secrecy multiplication requires a multiplication result from 2k-1 servers. In this paper, we propose a secrecy multiplication based on Shamir’s (k, n)-threshold secret-sharing scheme that uses only k servers. Through this scheme, the system can realize secrecy calculation without altering the threshold level.
Chapter PDF
Similar content being viewed by others
Keywords
References
Damgård, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty Computation from Somewhat Homomorphic Encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643–662. Springer, Heidelberg (2012)
Aggarwal, C.C., Yu, P.S.: A General Survey of Privacy-Preserving Data Mining Models and Algorithms, pp. 11–52. Springer (2008)
Blakley, G.R.: Safeguarding Cryptographic Keys. In: Proc. of the AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317 (1979)
Cramer, R., Damgård, I., Nielsen, J.B.: Multiparty Computation from Threshold Homomorphic Encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280–300. Springer, Heidelberg (2001)
Yao, A.C.: Protocols for Secure Computations. In: FOCS 1982, pp. 160–164. IEEE Press (1982)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: STOC 1988, pp. 1–10. ACM Press (1988)
Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSSand Fast-track Multiparty Computations with Applications to Threshold Cryptography. In: PODC 1998 Proceedings of the Seventeenth Annual ACM Symposiumon Principles of Distributed Computing, pp. 101–111 (1998)
Shamir, A.: How to Share a Secret. Communications of the ACM, 612–613 (1979)
Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally ComposableTwo-party and Multi-party Secure Computation. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, STOC 2002, pp. 494–503 (2002)
Beaver, D.: Efficient Multiparty Protocols Using Circuit Randomization. In: Feigenbaum, J. (ed.) Advances in Cryptology - CRYPTO 1991. LNCS, vol. 576, pp. 420–432. Springer, Heidelberg (1992)
Bendlin, R., Damgård, I., Orlandi, C., Zakarias, S.: Semi-homomorphic Encryption and Multiparty Computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169–188. Springer, Heidelberg (2011)
Damgård, I., Orlandi, C.: Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 558–576. Springer, Heidelberg (2010)
Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 143–202 (2000)
Yao, A.C.: How to Generate and Exchange Secrets. In: STOC 1986, pp. 162–167 (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Watanabe, T., Iwamura, K., Kaneda, K. (2015). Secrecy Multiplication Based on a (k, n)-Threshold Secret-Sharing Scheme Using Only k Servers. In: Park, J., Stojmenovic, I., Jeong, H., Yi, G. (eds) Computer Science and its Applications. Lecture Notes in Electrical Engineering, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45402-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-662-45402-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45401-5
Online ISBN: 978-3-662-45402-2
eBook Packages: EngineeringEngineering (R0)