A. Juels and J. Brainard, Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks, the 1999 Network and Distributed System Security Symposium (NDSS '99), pp.151-165, 1999.

T. Aura, P. Nikander, and J. Leiwo, DoS-resistant authentication with client puzzles, pp.170-181, 2000.
DOI : 10.1007/3-540-44810-1_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.9259

W. Feng, The case for TCP/IP Puzzles, ACM SIGCOMM 2003 Workshops, pp.25-27, 2003.

R. L. Rivest, A. Shamir, and D. A. Wagner, Time-lock Puzzles and Timed-release Crypto, 1996.

M. Jakobsson and A. Juels, Proofs of work and bread pudding protocols, the IFIP TC6 and TC11 Joint Working Conference on Communications and Multimedia Security (CMS 99, 1999.

V. Bocan and M. F. Cosma, Adaptive Threshold Puzzles, EUROCON 2005, The International Conference on "Computer as a Tool", 2005.
DOI : 10.1109/EURCON.2005.1630012

M. Ma, Mitigating denial of service attacks with password puzzles, International Conference on Information Technology: Coding and Computing (ITCC'05), Volume II, pp.621-626, 2005.
DOI : 10.1109/ITCC.2005.200

B. Groza and D. Petrica, On Chained Cryptographic Puzzles, 3rd Romanian- Hungarian Joint Symposium on Applied Computational Intelligence (SACI), 2006.

A. J. Jeckmans, Practical client puzzle from repeated squaring, 2009.

A. K. Lenstra, H. W. Jr, and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982.
DOI : 10.1007/BF01457454

A. Joux and J. Stern, Lattice Reduction: A Toolbox for the Cryptanalyst, Journal of Cryptology, vol.11, issue.3, pp.161-185, 1998.
DOI : 10.1007/s001459900042

P. Q. Nguyen and J. Stern, Lattice Reduction in Cryptology: An Update, ANTS- IV: Proceedings of the 4th International Symposium on Algorithmic Number Theory, pp.85-112, 2000.
DOI : 10.1007/10722028_4

S. Tritilanunt, C. Boyd, E. Foo, and J. M. Nieto, Toward Non-parallelizable Client Puzzles, CANS'07: 6th International Conference on Cryptology & Network Security, 2007.
DOI : 10.1007/978-3-540-76969-9_16

M. J. Coster, A. Joux, B. A. Lamacchia, A. M. Odlyzko, C. Schnorr et al., Improved low-density subset sum algorithms, Computational Complexity, vol.9, issue.1, pp.111-128, 1992.
DOI : 10.1007/BF01201999

C. Meadows, A cost-based framework for analysis of denial of service in networks, Journal of Computer Security, vol.9, issue.1-2, pp.143-164, 2001.
DOI : 10.3233/JCS-2001-91-206