M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract), The Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp.1-10, 1988.
DOI : 10.1145/62212.62213

P. Bogetoft, D. L. Christensen, I. Damgard, M. Geisler, T. P. Jakobsen et al., Secure Multiparty Computation Goes Live, The Proceedings of the 13th International Conference on Financial Cryptography and Data Security (FC), pp.325-343, 2009.
DOI : 10.1007/978-3-642-03549-4_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.6537

D. Chaum, C. Crépeau, and I. Damgard, Multiparty unconditionally secure protocols, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.11-19, 1988.
DOI : 10.1145/62212.62214
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.649.1111

O. Goldreich, S. Micali, and A. Wigderson, How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority, The Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), pp.218-229, 1987.

F. Kerschbaum, A. Schropfer, A. Zilli, R. Pibernik, O. Catrina et al., Secure Collaborative Supply-Chain Management, Computer, vol.44, issue.9, pp.38-43, 2011.
DOI : 10.1109/MC.2011.224
URL : http://hdl.handle.net/2434/174798

A. C. Yao, Protocols for Secure Computations (Extended Abstract), The Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp.160-164, 1982.