Semi-trusted hosts and mobile agents: Enabling secure distributed computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1931, Issue , 2000, Pages 219-230

  De Decker, Bart ^a   Piessens, Frank ^a   Van Hoeymissen, Erik ^a   Neven, Gregory ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; ECONOMIC AND SOCIAL EFFECTS;

COMMUNICATION OVERHEADS; CRYPTOGRAPHIC PROTOCOLS; CRYPTOGRAPHIC TECHNIQUES; DISTRIBUTED COMPUTATIONS; EXECUTION PLATFORMS; THIRD PARTIES; TRUSTED HOST; TRUSTED THIRD PARTIES;

MOBILE AGENTS;

EID: 84937408341     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45391-1_18     Document Type: Conference Paper

References (16)

1. 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.
2. C. Cachin, J. Camenisch, J. Kilian and J. Müller, "One round Secure Computation and Secure Autonomous Mobile Agents," submitted to ICALP 2000.
3. D. Chaum, I. Damgârd and J. van de Graaf, "Multiparty computations ensuring privacy of each party's input and correctness of the result," in Advances in Cryptology-CRYPTO '87 Proceedings (Lecture Notes in Computer Science, Vol. 293), ed. C. Pomerance, p. 87-119, Springer-Verlag, New York, 1988.
4. 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.
5. R. Cramer. "An introduction to secure computation," in LNCS 1561, pp 16-62, 1999.
6. S. Even, O. Goldreich, A. Lempel. "A randomized protocol for signing contracts." Communications of the ACM, vol. 28, 1985, pp. 637-647.
7. M. Franklin, "Complexity and security of distributed protocols," Ph. D. thesis, Computer Science Department of Columbia University, New York, 1993.
8. M. Franklin and S. Haber, "Joint encryption and message-efficient secure computation," Journal of Cryptology, 9(4), p. 217-232, Autumn 1996.
9. 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.
10. O. Goldreich, R. Vainish. "How to solve any protocol problem: an efficiency improvement," Proceedings of Crypto'87, LNCS 293, pp. 73-86, Springer Verlag, 1987.
11. S. Loureiro and R. Molva, "Privacy for Mobile Code," Proceedings of the workshop on Distributed Object Security, OOPSLA '99, p. 37-42.
12. G. Neven, F. Piessens, B. De Decker, "On the Practical Feasibility of Secure Distributed Computing: a Case Study," to appear in Proceedings of WCC2000.
13. N. Nisan, "Algorithms for selfish agents," Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 1999, p. 1-15.
14. T. Sander and C. Tschudin, "On software protection via function hiding," Proceedings of the second workshop on Information Hiding, Portland, Oregon, USA, April 1998.
15. T. Sander and C. Tschudin, "Towards mobile cryptography," Proceedings of the 1998 IEEE Symposium on Security and Privacy, Oakland, California, May 1998.
16. 1," preprint.