Uncheatable distributed computations

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

Volumn 2020, Issue , 2001, Pages 425-440

  Golle, Philippe ^a   Mironov, Ilya ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Distributed computing; Magic numbers; Ringers

Indexed keywords

BELLS; DISTRIBUTED COMPUTER SYSTEMS;

COMMERCIAL SETTINGS; DISTRIBUTED COMPUTATIONS; HIGH PROBABILITY; MAGIC NUMBERS; SECURITY SCHEME;

CRYPTOGRAPHY;

EID: 84937555419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45353-9_31     Document Type: Conference Paper

References (24)

1. W. Aiello, S. Bhatt, R. Ostrovsky and S. Rajagopalan. Fast verification of any remote procedure call: short witness-indistinguishable one-round proofs for NP. In Proc. of ICALP 2000, pp. 463-474.
2. M. Allen. Do-it-yourself climate prediction. In Nature, 401, p. 642, Oct. 1999.
3. J. Baldeschwieler, R. Blumofe and E. Brewer. ATLAS: An Infrastructure for Global Computing. In Proc. of the 7th ACM SIGOPS European Workshop, 1996.
4. A. Baratloo, M. Karaul, Z. Kedem and P. Wyckoff. Charlotte: Metacom-puting on the Web. In Future Generation Computer Systems, 15 (5-6), pp. 559-570, 1999.
5. D. Bedell. Search for extraterrestrials|or extra cash. In The Dallas Mor-ning News, 12/02/99, also available at: http://www. dallasnews. com/technology/1202ptech9pcs. htm.
6. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc. of the First ACM Conf. on Computer and Communications Security, pp. 62-73, 1993.
7. K. Bharat and A. Broder. A technique for measuring the relative size and overlap of public Web search engines. In WWW7/Computer Networks 30(1-7), pp. 379-388, 1998.
8. M. Blum and S. Kannan. Programs That Check TheirWork. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 1989.
9. C. Cachin, S. Micali and M. Stadler. Computationally private infor-mation retrieval with polylogarithmic communication. In Proc. of EU-ROCRYPT'99, LNCS 1592, pp. 402-414, 1999.
10. J. Cai, R. Lipton, R. Sedgewick and A. Yao. Towards uncheatable bench-marks. In Proc. of 8th Annual Structure in Complexity Theory Conference, pp. 2-11, 1993.
11. Y. Dodis, S. Halevi and T. Rabin. A cryptographic solution to a game theoretic problem. In Proc. of CRYPTO'00, LNCS 1880, pp. 112-131, 2000.
12. J. Feigenbaum. Encrypting problem instances: Or…, Can you take advan-tage of someone without having to trust him? In Proc. of CRYPTO 1985, LNCS 218, pp. 477-488.
13. F. Hohl. A model of attacks of malicious hosts against mobile agents. In 4th ECOOP Workshop on Mobile Object Systems, 1998.
14. Y. Minsky, R. van Renesse, F. Schneider and S Stoller. Cryptographic sup-port for fault-tolerant distributed computing. TR96-1600, Department of Computer Science, Cornell University, 1996.
15. F. Monrose, P. Wyckoff and A. Rubin. Distributed execution with remote audit. In Proc. of the Network and Distributed System Security Symposium, pp. 103-113, 1999.
16. N. Nisan, S. London, O. Regev and N. Camiel. Globally Distributed Com-putations over the Internet-the popcorn Project. In Proc. of the Interna-tional conference on Distributed Computing Systems, pp. 592-601, 1998.
17. T. Sanders and C. Tschudin. Toward mobile cryptography. In IEEE Sym-posium on Security and Privacy, 1998.
18. L. Sarmenta and S. Hirano. Bayanihan: Building and studying volunteer computing systems using Java. In Future Generation Computer Systems, 15 (5-6), pp. 675-686, 1999.
19. Ed. D. Sullivan. Search Engine Sizes. Ongoing. http://www. searchenginewatch. com/reports/sizes. html
20. SETI@home, http://setiathome. berkeley. edu.
21. G. Vigna. Protecting Mobile Agents through Tracing. In Proc. of the 3rd Workshop on Mobile Object Systems, June 1997.
22. G. Vigna (Ed.). Mobile Agents and Security. LNCS 1419, 1998.
23. H. Wasserman and M. Blum. Software reliability via run-time result-checking. In Journal of the ACM, 44(6), pp. 826-849, 1997.
24. B. Yee. A sanctuary for mobile agents. In DARPA Works-hop on Foundations for Secure Mobile Code, 26-28 March 1997, http://www-cse. ucsd. edu/users/bsy/pub/sanctuary. fsmc. ps.