One-round secure computation and secure autonomous mobile agents

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

Volumn 1853, Issue , 2000, Pages 512-523

  Cachin, Christian ^a   Camenisch, Jan ^a   Kilian, Joe ^b   Müller, Joy ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; AUTONOMOUS AGENTS; CRYPTOGRAPHY; HARDNESS; INFORMATION THEORY;

AUTONOMOUS MOBILE AGENT; DECISIONAL DIFFIE-HELLMAN PROBLEMS; INFORMATION- THEORETIC SECURITIES; MALICIOUS BEHAVIOR; POLYNOMIAL SIZE; PUBLIC KEYS; SECURE COMPUTATION;

MOBILE AGENTS;

EID: 84974577749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_43     Document Type: Conference Paper

References (26)

1. M. Abadi and J. Feigenbaum, “Secure circuit evaluation: A protocol based on hiding information from an oracle,” Journal of Cryptology, vol. 2, pp. 1-12, 1990.
2. M. Abadi, J. Feigenbaum, and J. Kilian, “On hiding information from an oracle,” Journal of Computer and System Sciences, vol. 39, pp. 21-50, 1989.
3. D. Beaver, “Foundations of secure interactive computing,” in Proc. CRYPTO '91 (J. Feigenbaum, ed.), LNCS 576, 1992.
4. M. Bellare and S. Micali, “Non-interactive oblivious transfer and applications,” in Proc. CRYPTO '89 (G. Brassard, ed.), LNCS 435, pp. 547-557, 1990
5. M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for noncryptographic fault-tolerant distributed computation,” in Proc. 20th STOC, pp. 1-10, 1988.
6. M. Blum, P. Feldman, and S. Micali, “Non-interactive zero-knowledge proof systems and its applications,” in Proc. 20th STOC, pp. 103-112, 1988.
7. D. Boneh and R. J. Lipton, “Searching for elements in black box fields and applications,” in Proc. CRYPTO '96, LNCS 1109, 1996.
8. G. Brassard, C. Crépeau, and J.-M. Robert, “Information theoretic reductions among disclosure problems,” in Proc. 27th FOCS, 1986.
9. R. Canetti, “Security and composition of multi-party cryptographic protocols,” Journal of Cryptology, vol. 13, no. 1, pp. 143-202, 2000.
10. R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali, “Resettable zeroknowledge,” in Proc. 32nd STOC, 2000.
11. 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 Proc. CRYPTO '87 (C. Pomerance, ed.), LNCS 293, 1988.
12. R. Cramer, I. Damgård, and B. Schoemakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” in Proc. CRYPTO '94 (Y. G. Desmedt, ed.), LNCS 839, 1994.
13. U. Feige, J. Kilian, and M. Naor, “A minimal model for secure computation (extended abstract),” in Proc. 26th STOC, pp. 554-563, 1994.
14. U. Feige, D. Lapidot, and A. Shamir, “Multiple noninteractive zero knowledge proofs under general assumptions,” SIAM Journal on Computing, vol. 29, no. 1, pp. 1-28, 1999.
15. J. Feigenbaum and M. Merritt, “Open questions, talk abstracts, and summary of discussions,” in Distributed Computing and Cryptography, AMS, 1991.
16. O. Goldreich, S. Goldwasser, and S. Micali, “How to construct random functions,” Journal of the ACM, vol. 33, pp. 792-807, Oct. 1986.
17. O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game or a completeness theorem for protocols with honest majority,” in Proc. 19th STOC, pp. 218-229, 1987.
18. S. Micali and P. Rogaway, “Secure computation,” in Proc. CRYPTO '91 (J. Feigenbaum, ed.), LNCS 576, pp. 392-404, 1992.
19. M. Naor and O. Reingold, “Number-theoretic constructions of efficient pseudorandom functions,” in Proc. 38th FOCS, 1997.
20. R. Ostrovsky, R. Venkatesan, and M. Yung, “Fair games against an all-powerful adversary,” in Advances in Computational Complexity Theory, AMS, 1993.
21. C. Rackoff and D. R. Simon, “Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack,” in Proc. CRYPTO '91 (J. Feigenbaum, ed.), LNCS 576, pp. 433-444, 1992.
22. R. L. Rivest, L. Adleman, and M. L. Dertouzos, “On data banks and privacy homomorphisms,” in Foundations of Secure Computation (R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton, eds.), pp. 169-177, Academic Press, 1978.
23. P. Rogaway, The Round Complexity of Secure Protocols. PhD thesis, MIT, 1991.
24. T. Sander and C. F. Tschudin, “Protecting mobile agents against malicious hosts,” in Mobile Agents and Security (G. Vigna, ed.), LNCS 1419, 1998.
25. T. Sander, A. Young, and M. Yung, “Non-interactive CryptoComputing for NC1,” in Proc. 40th FOCS, 1999.
26. A. C. Yao, “How to generate and exchange secrets,” in Proc. 27th FOCS, pp. 162-167, 1986.