Hardening functions for large scale distributed computations

Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy

Volumn , Issue , 2003, Pages 216-224

  Szajda, Doug ^a   Lawson, Barry ^a   Owen, Jason ^a  

^a UNIVERSITY OF RICHMOND   (United States)

Author keywords

Distributed computation; Probabilistic verification; Ringers

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER CRIME; CRYPTOGRAPHY; INTERNET; MONTE CARLO METHODS; OPTIMIZATION; PERSONAL COMPUTERS; SECURITY OF DATA; SUPERCOMPUTERS;

CORRUPTION OF DATA; HARDENING FUNCTIONS; PROBABILISTIC VERIFICATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0038148401     PISSN: 10637109     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. M. Abadi and J. Feigenbaum. Secure circuit evaluation: A protocol based on hiding information from an oracle. Journal of Cryptology, 2(1):1-12, 1990.
2. J. Baldeschwieler, R. Blumofe, and E. Brewer. Atlas: An infrastructure for global computing. In Proceedings of the Seventh ACM SIGOPS European Workshop on System Support for Worldwide Applications, 1996.
3. A. Baratloo, M. Karaul, Z. M. Kedem, and P. Wyckoff. Charlotte: Metacomputing on the web. In Proc. of the 9th Int'l Conf. on Parallel and Distributed Computing Systems (PDCS-96), 1996.
4. T. Brecht, H. Sandau, M. Shan, and J. Talbot. Paraweb: Towards world-wide supercomputing. In Proceedings of the Seventh ACM SIGOPS European Workshop on System Support for Worldwide Applications, 1996.
5. J. Bruce. A really trivial proof of the Lucas-Lehmer test. American Mathematical Monthly, 100:370-371, 1993.
6. P. Capello, B. Christiansen, M. Ionescu, M. Neary, K. Schauser, and D. Wu. Javelin: Internet-based parallel computing using Java. Concurrency: Practice and Experience, 9(11):1139-1160, 1997.
7. The Folding @ home Project. Stanford University. http://www.stanford.edu/group/pandegroup/cosm/.
8. The Great Internet Mersenne Prime Search. http://www.mersenne.org/prime.htm.
9. P. Golle and I. Mironov. Uncheatable distributed computations. In Proceedings of the RSA Conference 2001, Cryptographers' Track, pages 425-441, San Francisco, CA, 2001, Springer.
10. P. Golle and S. Stubblebine. Secure distributed computing in a commercial environment. 2001. http://crypto.stanford.edu/~pgolle/papers/payout.html.
11. A. Law and W. Kelton. Simulation Modeling and Analysis. McGraw-Hill, 3rd edition, 2000.
12. Y. Minsky, R. van Renesse, F. Schneider, and S. Stoller. Cryptographic support for fault-tolerant distributed computing. In Seventh ACM SIGOPS European Workshop, pages 109-114, Connemara, Ireland, 1996.
13. F. Monrose, P. Wyckoff, and A. Rubin. Distributed execution with remote audit. In Proceedings of the 1999 ISOC Network and Distributed System Security Symposium, pages 103-113, 1999.
14. N. Nisan, S. London, O. Regev, and N. Camiel. Globally distributed computing over the internet-the Popcorn project. In Proceedings of the International Conference on Distributed Computing Systems, pages 592-601, Amsterdam. Netherlands, May 1998.
15. R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms. In R. D. Millo, D. Dobkin, A. Jones, and R. Lipton, editors, Foundations of Secure Computation, pages 169-179. Academic Press, New York, 1978.
16. T. Sander and C. F. Tschudin. Protecting Mobile Agents Against Malicious Hosts. In G. Vigna, editor, Mobile Agent Security, pages 44-60. Springer-Verlag: Heidelberg, Germany, 1998.
17. L. Sarmenta and S. Hirano. Bayanihan: Building and studying web-based volunteer computing systems using java. Future Generation Computer Systems, 15(5/6), 1999.
18. The Search for Extraterrestrial Intelligence project. University of California, Berkeley. http://setiathome.berkeley.edu/.
19. T. Stein. A cycle built for few. In Red Herring magazine, December 2000.
20. P. Syverson. Weakly secret bit commitment: Applications to lotteries and fair exchange. In PCSFW: Proceedings of The 11th Computer Security Foundations Workshop. IEEE Computer Society Press, 1998.
21. G. Vigna. Cryptographic Traces for Mobile Agents. In G. Vigna, editor, Mobile Agent Security, pages 137-153, Springer-Verlag: Heidelberg, Germany, 1998.
22. H. Wasserman and M. Blum. Software reliability via run-time result-checking. Journal of the ACM, 44(6):826-849, 1997.