Abstract
Secure Distributed Computing addresses the problem of performing a computation with a number of mutually distrustful participants, in such a way that each of the participants has only limited access to the information needed for doing the computation. Over the past decade, a number of solutions for this problem have been developed. The various proposed solutions differ in the cryptographic primitives that are used, and in the class of computations that can be performed. However, all sufficiently general solutions have one thing in common: the communication overhead between the involved parties seems to be prohibitive.
In this paper, we consider a concrete instance (with considerable practical interest) of the general problem of secure distributed computing, and we investigate how bad the communication overhead really is. This involves tailoring the different general solutions to the specific problem at hand, optimizing them for minimal communication overhead, and evaluating the resulting communication overhead.
Postdoctoral Fellow of the Belgian National Fund for Scientific Research (F.W.O.)
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35515-3_53
Chapter PDF
Similar content being viewed by others
References
M. Abadi and J. Feigenbaum, “Secure circuit evaluation, a protocol based on hiding information from an oracle,” Journal of Cryptology, 2 (1), p. 1–12, 1990
B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan, “Private information retrieval,” Proc. of 36th IEEE Conference on the Foundations of Computer Science (FOCS), p. 41–50, 1995
D.E. Denning and J. Schlörer, “A Fast Procedure for Finding a Tracker in a Statistical Database,” ACM Transactions on Database Systems, 5, 1, p. 88–102, 1980.
M. Franklin, “Complexity and security of distributed protocols,” Ph. D. thesis, Computer Science Department of Columbia University, New York, 1993
M. Franklin and S. Haber, “Joint encryption and message-efficient secure computation,” Journal of Cryptology, 9 (4), p. 217–232, Autumn 1996
O. Goldreich, S. Micali and A. Wigderson, “How to play any mental game,” Proc. of 19th ACM Symposium on Theory of Computing (STOC), p. 218–229, 1987
S. Loureiro and R. Molva, “Privacy for Mobile Code”, Proceedings of the workshop on Distributed Object Security, OOPSLA ‘89, p. 3742.
T. Sander and C. Tschudin, “On software protection via function hiding”, Proceedings of the second workshop on Information Hiding, Portland, Oregon, USA, April 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this paper
Cite this paper
Neven, G., Piessens, F., De Decker, B. (2000). On the Practical Feasibility of Secure Distributed Computing. In: Qing, S., Eloff, J.H.P. (eds) Information Security for Global Information Infrastructures. SEC 2000. IFIP — The International Federation for Information Processing, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35515-3_37
Download citation
DOI: https://doi.org/10.1007/978-0-387-35515-3_37
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5479-7
Online ISBN: 978-0-387-35515-3
eBook Packages: Springer Book Archive