Low-cost client puzzles based on modular exponentiation

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

Volumn 6345 LNCS, Issue , 2010, Pages 679-697

  Karame, Ghassan O ^a   Čapkun, Srdjan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Client Puzzles; DoS Attacks; Outsourcing of Modular Exponentiation; Secure Verification of Computing Performance

Indexed keywords

DENIAL-OF-SERVICE ATTACK; ELECTRIC EQUIPMENT PROTECTION; NETWORK PROTOCOLS; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

CLIENT PUZZLES; COMPUTING PERFORMANCE; CRYPTOGRAPHICS; DENIALOF- SERVICE ATTACKS; HIGH COSTS; LOW-COSTS; MODULAR EXPONENTIATION; OUTSOURCING OF MODULAR EXPONENTIATION; PUBLIC KEYS; SECURE VERIFICATION OF COMPUTING PERFORMANCE;

COSTS;

EID: 78049359365     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15497-3_41     Document Type: Conference Paper

References (50)

1. PlanetLab, An open platform for developing, deploying, and accessing planetaryscale services, http://www.planet-lab.org/
2. Linpack, http://www.netlib.org/linpack/
3. Distributed. Net, http://distributed.net/
4. TOP500 Supercomputing Sites, http://www.top500.org/
5. Conroe Performance Claim being Busted, http://sharikou.blogspot.com/2006/ 04/conroe-performance-claim-being-busted.html
6. Computer Software Manufacturer agrees to settle Charges, http://www.ftc.gov/opa/1996/07/softram.shtm
7. Atallah, M. J., Pantazopoulos, K. N., Rice, J. R., Spafford, E. H.: Secure Outsourcing of Scientific Computations. In: Advances in Computers (2001)
8. Blomer, J., May, A.: Low Secret Exponent RSA Revisited. In: Silverman, J. H. (ed.) CaLC 2001. LNCS, vol. 2146, p. 4. Springer, Heidelberg (2001)
9. Boneh, D.: Twenty Years of Attacks on the RSA Cryptosystem. Notices of the American Mathematical Society, AMS (1999)
10. 0.292. IEEE Transactions on Information Theory, 1339-1349 (2000)
11. Boneh, D., Schackam, H.: Fast Variants of RSA. In: CryptoBytes (2002)
12. Burns, J., Mitchell, C. J.: On parameter selection for server-aided RSA computation schemes. IEEE Transactions on Computers (1994)
13. Cai, J., Nerurkar, A., Wu, M.: The Design of Uncheatable Benchmarks Using Complexity Theory, ftp://ftp.cs.buffalo.edu/pub/tech-reports/./97-10.ps. Z
14. Chen, L., Morrissey, P., Smart, N., Warinschi, B.: Security Notions and Generic Constructions for Client Puzzles. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 505-523. Springer, Heidelberg (2009)
15. Coppersmith, D.: Finding a Small Root of a Univariate Modular Equation. In: Maurer, U. M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155-165. Springer, Heidelberg (1996)
16. Coppersmith, D.: Small solutions to polynomial equations and low exponent vulnerabilities. Journal of Cryptology, 223-260 (1997)
17. Coppersmith, D., Franklin, M., Patarin, J., Reiter, M.: Low-exponent RSA with related messages. In: Maurer, U. M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 1-9. Springer, Heidelberg (1996)
18. Cui-xiang, Z., Guo-qiang, H., Ming-he, H.: Some New Parallel Fast Fourier Transform Algorithms. In: Proceedings of Parallel and Distributed Computing, Applications and Technologies (2005)
19. Curnow, H. J., Wichman, B. A.: A Synthetic Benchmark. Computer Journal (1976)
20. de Weger, B.: Cryptanalysis of RSA with small prime difference. In: Applicable Algebra in Engineering, Communication and Computing (2002)
21. Dean, D., Stubblefield, A.: Using client puzzles to protect TLS. In: Proceedings of the USENIX Security Symposium (2001)
22. Doshi, S., Monrose, F., Rubin, A.: Efficient Memory Bound Puzzles using Pattern Databases. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, pp. 98-113. Springer, Heidelberg (2006)
23. Durfee, G., Nguyen, P.: Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt 1999. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, p. 14. Springer, Heidelberg (2000)
24. Gao, Y.: Efficient Trapdoor-Based Client Puzzle System against DoS Attacks (2005)
25. Hastad, J.: Solving Simultaneous Modular Equations of Low Degree. SIAM J. Computing (1988)
26. Hinek, M. J.: Cryptanalysis of RSA and its variants. In: Cryptography and Network Security, Chapman & Hall/CRC (2009)
27. Hinek, M. J., Lam, C. C. Y.: Common Modulus Attacks on Small Private Exponent RSA and Some Fast Variants (in Practice). In: Cryptology ePrint Archive (2009)
28. Hinek, M. J.: Another Look at Small RSA Exponents. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 82-98. Springer, Heidelberg (2006)
29. Hohenberger, S., Lysyanskaya, A.: How to Securely Outsource Cryptographic Computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 264-282. Springer, Heidelberg (2005)
30. Howgrave-Graham, N., Seifert, J. P.: Extending Wiener's Attack in the Presence of Many Decrypting Exponents. In: Proceedings of the International Exhibition and Congress on Secure Networking (1999)
31. 0.073. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 395-411. Springer, Heidelberg (2007)
32. Juels, A., Brainard, J.: Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks. In: Proceedings of NDSS (1999)
33. Katzenbeisser, S.: Recent Advanves in RSA Cryptography. In: Advances in Information Security, vol. 3 (2001)
34. Keqin, L.: Scalable Parallel Matrix Multiplication on Distributed Memory-Parallel Computers. In: Proceedings of IPDPS (2000)
35. Koblitz, N.: A Course in Number Theory (1987)
36. Kaya Koc, C., Acar, T., Kaliski, B. S.: Analyzing and Comparing Montgomery Multiplication Algorithms (1996)
37. Martin, A., Burrows, M., Manasse, M., Wobber, T.: Moderately Hard, Memory-Bound Functions. ACM Transcations on Internet Technologies (2005)
38. rq. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 218-230. Springer, Heidelberg (2004)
39. McGinn, S. F., Shaw, R. E.: Parallel Gaussian elimination using OpenMP and MPI. In: Proceedings of the International Symposium on High Performance Computing Systems and Applications (2002)
40. Miller, G. L.: Riemann's Hypothesis and Tests for Primality. In: Proc. Seventh Annual ACM Symp. on the Theory of Computing (1975)
41. Reiter, M. K., Sekar, V., Spensky, C., Zhang, Z.: Making peer-assisted content distribution robust to collusion using bandwidth puzzles. In: Prakash, A., Sen Gupta, I. (eds.) ICISS 2009. LNCS, vol. 5905, pp. 132-147. Springer, Heidelberg (2009)
42. Rivest, R. L., Shamir, A., Adleman, L. M.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 120-126 (1978)
43. Rivest, R. L., Shamir, A., Wagner, D. A.: Time-lock Puzzles and Timed-release Crypto. MIT Technical Report (1996)
44. Sedgewick, R., Chi-Chih Yao, A.: Towards Uncheatable Benchmarks. In: Proceedings of The Structure in Complexity Theory Conference (1993)
45. Tritilanunt, S., Boyd, C., Gonzalez Nieto, J. M., Foo, E.: Toward Non-Parallelizable Client Puzzles. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) CANS 2007. LNCS, vol. 4856, pp. 247-264. Springer, Heidelberg (2007)
46. van Dijk, M., Clarke, D., Gassend, B., Suh, G. E., Devadas, S.: Speeding up Exponentiation using an Untrusted Computational Resource. In: Designs, Codes and Cryptography, vol. 39, pp. 253-273 (2006)
47. Wang, X., Reiter, M.: Defending Against Denial-of-Service Attacks with Puzzle Auctions. In: Proceedings of the IEEE Symposium on Security and Privacy (2003)
48. Wang, X., Reiter, M. K.: A Multi-layer Framework for Puzzle-based Denial-of-Service Defense. International Journal of Information Security (2007)
49. Waters, B., Juels, A., Halderman, J. A., Felten, E. W.: New client puzzle outsourcing techniques for DoS resistance. In: Proceedings of the ACM Conference on Computer and Communications Security (2004)
50. Wiener, M.: Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information Theory, 553-558 (1990)