Distributed asymmetric verification in computational grids

IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

Volumn , Issue , 2008, Pages

  Kuhn, Michael ^a   Schmid, Stefan ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER NETWORKS; COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS;

DISCRETE LOGARITHM PROBLEM; GRID SERVERS; PARALLEL AND DISTRIBUTED PROCESSING; PARALLEL IMPLEMENTATIONS;

GRID COMPUTING;

EID: 51049103639     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2008.4536244     Document Type: Conference Paper

References (27)

1. W. Aiello, S. N. Bhatt, R. Ostrovsky, and S. Rajagopalan. Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP. In Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP), pages 463-474, 2000.
2. D. P. Anderson. BOINC: A System for Public-Resource Computing and Storage. In Proc. 5th IEEE/ACM International Workshop on Grid Computing., pages 4-10, 2004.
3. R. Beigel, G. Margulis, and D. A. Spielman. Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds. In Proc. 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 21-29, 1993.
4. Berkeley Open Infrastructure for Network Computing. BOINC Combined Statistics. In http://boinc.netsoft-online.com/, 2006.
5. S. Brin and L. Page. The Anatomy of Large-Scale Hypertextual Web Search Engine. In Proc. Computer Networks and ISDN Systems, 1998.
6. C. Cachin, S. Micali, and M. Stadler. Computationally Private Information Retrieval with Polylogarithmic Communication. Lecture Notes in Computer Science, 1592:402-414, 1999.
7. Carnegie Mellon University. What is reCAPTCHA? 2004.
8. C. Christensen, T. Aina, and D. Stainforth. The Challenge of Volunteer Computing With Lengthy Climate Model Simulations. E-SCIENCE, IEEE Computer Society, 2005.
9. Climate Prediction. http://www.climateprediction.net/.
10. distributed.net. http://www.distributed.net/.
11. J. R. Douceur. The Sybil Attack. In Proc. 1st International Workshop on Peer-to-Peer Systems (IPTPS), pages 251-260, 2002.
12. J. R. Douceur and T. Moscibroda. Lottery Trees: Motivational Deployment of Networked Systems. In Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2007.
13. W. Du and M. T. Goodrich. Searching for High-Value Rare Events with Uncheatable Grid Computing. In Proc. 3rd Applied Cryptography and Network Security Conference (ACNS), pages 122-137, 2005.
14. W. Du, J. Jia, M. Mangal, and M. Murugesan. Uncheatable Grid Computing. In Proc. 24th International Conference on Distributed Computing Systems (ICDCS), pages 4-11, 2004.
15. R. Gallant, R. Lambert, and S. Vanstone. Improving the Parallelized Pollard Lambda Search on Binary Anomalous Curves. Mathematics of Computation, 1998.
16. P. Golle and I. Mironov. Uncheatable Distributed Computations. In Proc. 2001 Conference on Topics in Cryptology, pages 425-440, 2001.
17. P. Golle and S. G. Stubblebine. Secure Distributed Computing in a Commercial Environment. In Proc. 5th International Conference on Financial Cryptography, pages 289-304, 2002.
18. http://boinc.berkeley.edu/. BOINC - Berkeley Open Infrastructure for Network Computing.
19. L. Kahney. Cheaters Bow to Peer Pressure. Wired Magazine, February 15, 2001.
20. S. M. Larson, C. D. Snow, M. R. Shirts, and V. S. Pande. Folding@Home and Genome@Home: Using Distributed Computing to Tackle Previously Intractable Problems in Compuational Biology. Computational Genomics, 2002.
21. A. J. Menezes, P. C. van Oorshot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
22. J. M. Pollard. Monte Carlo Methods for Index Computation (modp). Math.Comp, 32(143):918-924, 1978.
23. M. Shirts and V. S. Pande. Screensavers of theWorld, Unite! Science, 290(5498):1903-1904.
24. D. Szajda, B. Lawson, and J. Owen. Hardening Functions for Large Scale Distributed Computations. In Proc. 2003 IEEE Symposium on Security and Privacy, 2003.
25. E. Teske. Speeding Up Pollard's Rho Method for Computing Discrete Logarithms. In Proc. 3rd International Symposium on Algorithmic Number Theory (ANTS), pages 541-554, 1998.
26. P. C. van Oorschot and M. J. Wiener. Parallel Collision Search with Application to Hash Functions and Discrete Logarithms. In Proc. 2nd ACM Conference on Computer and Communications Security, pages 210-218, 1994.
27. M. J. Wiener and R. J. Zuccherato. Faster Attacks on Elliptic Curve Cryptosystems. In Proc. Selected Areas in Cryptography (SAC), pages 190-200, 1998.