D. Beaver, Efficient Multiparty Protocols Using Circuit Randomization, Advances in Cryptology -CRYPTO '91, pp.420-432

H. Springer-berlin, , 1992.

M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Noncryptographic Fault-tolerant Distributed Computation, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing. STOC '88, 1988.

J. C. Benaloh, Secret sharing homomorphisms: Keeping shares of a secret secret, Advances in Cryptology -CRYPTO' 86, pp.251-260, 1987.

C. L. Corniaux and H. Ghodosi, An entropy-based demonstration of the security of Shamir's secret sharing scheme, 2014 International Conference on Information Science, vol.1, pp.46-48, 2014.

Y. C. Chang and C. J. Lu, Oblivious polynomial evaluation and oblivious neural learning, Advances in Cryptology -ASIACRYPT, pp.369-384, 2001.

H. Springer-berlin, , 2001.

D. Chaum, C. Crépeau, and I. Damgård, Multiparty Unconditionally Secure Protocols, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp.11-19, 1988.

N. Döttling, S. Ghosh, J. B. Nielsen, T. Nilges, and R. Trifiletti, Tinyole: Efficient actively secure two-party computation from oblivious linear function evaluation, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp.2263-2276, 2017.

O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp.218-229, 1987.

G. Hanaoka, H. Imai, J. Mueller-quade, A. C. Nascimento, A. Otsuka et al., Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions, Information Security and Privacy, pp.62-73, 2004.

M. Naor and B. Pinkas, Oblivious Transfer and Polynomial Evaluation, Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, pp.245-254, 1999.

T. Rabin and M. Ben-or, Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing. STOC '89, 1989.

A. Shamir, How to share a secret, Commun. ACM, vol.22, issue.11, pp.612-613, 1979.

R. Tonicelli, A. C. Nascimento, R. Dowsley, J. Müller-quade, H. Imai et al., Information-theoretically secure oblivious polynomial evaluation in the commodity-based model, International Journal of Information Security, vol.14, issue.1, pp.73-84, 2015.