Secrecy Computation without Changing Polynomial Degree in Shamir's (K, N) Secret Sharing Scheme

Takeshi Shingu, Keiichi Iwamura, Kitahiro Kaneda. Secrecy Computation without Changing Polynomial Degree in Shamir's (K, N) Secret Sharing Scheme. In Christian Callegari, Marten van Sinderen, Panagiotis G. Sarigiannidis, Pierangela Samarati, Enrique Cabello, Pascal Lorenz, Mohammad S. Obaidat, editors, Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016) - Volume 1: DCNET, Lisbon, Portugal, July 26-28, 2016. pages 89-94, SciTePress, 2016. [doi]

Abstract

Abstract is missing.