C2Puzzle: A Novel Computational Client Puzzle for Network Security

Abstract:

Client puzzles, a type of cryptographic puzzle, have been proposed and developed by many scholars to guarantee network security. In this paper, we proposed C2Puzzle, a novel computational client puzzle. By using the iterative algorithm, C2Puzzle successfully combined the basic principles of prime factorization and discrete logarithm problem. We show that, C2Puzzle has the visible security advantages, and the adjustability of puzzle difficulty is in fine granularity.

• Periodical: Advanced Materials Research (Volumes 846-847)
• Pages: 1615-1619
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.846-847.1615
• Online since: November 2013
• Authors: Ming Wan*, Wen Li Shang, Jian Ming Zhao, Sheng Shan Zhang
• Keywords: Computational Client Puzzle, Discrete Logarithm Problem, Network Security, Prime Factorization

References

[1] R. C. Merkle: Secure Communications over Insecure Channels, Communications of the ACM, Vol. 21, No. 4 (1978), pp.294-299.

DOI: 10.1145/359460.359473

[2] M. S. Fallah: A Puzzle-based Defense Strategy against Flooding Attacks Using Game Theory, IEEE Transactions on Dependable and Secure Computing, Vol. 7, No. 1 (2010), pp.5-19.

DOI: 10.1109/tdsc.2008.13

[3] Y. K. Jing, J. T. C. Ming, D. Niyato: Rate Limiting Client Puzzle Schemes for Denial-of-Service Mitigation, in: Proceedings of 2013 IEEE Wireless Communications and Networking Conference, Shanghai, China (2013), pp.1848-1853.

DOI: 10.1109/wcnc.2013.6554845

[4] F. Tegeler, X. M. Fu: SybilConf: Computational Puzzles for Confining Sybil Attacks, in: Proceedings of 2010 INFOCOM on Computer Communications Workshops, San Diego, USA (2010), pp.1-2.

DOI: 10.1109/infcomw.2010.5466685

[5] A. Jeckmans: Practical Client Puzzle from Repeated Squaring, Technical Report, Centre for Telematics and Information Technology, University of Twente (2009), http: /eprints. eemcs. utwente. nl/15951.

[6] B. Groza, D. Petrica: On Chained Cryptographic Puzzles, in: Proceedings of the 3rd Romanian-Hungarian Joint Symposium on Applied Computational Intelligence, Timisoara, Romania (2006), pp.182-191.

[7] Y. Gao, W. Susilo, Y. WU, et al: Efficient Trapdoor Based Client Puzzle against DoS Attacks, Book Chapter in Network Security (2010), pp.229-249.

DOI: 10.1007/978-0-387-73821-5_10

[8] M. Abadi, M. Burrows, M. Manasse, et al: Moderately hard, Memory-bound Functions, ACM Transactions on Internet Technology (2005), Vol. 5, No. 2, pp.299-327.

DOI: 10.1145/1064340.1064341

[9] S. Doshi, F. Monrose, A. D. Rubin: Efficient Memory Bound Puzzles Using Pattern Databases, in: Proceedings of Applied Cryptography and Network Security: 4th International Conference, Singapore (2006), pp.98-113.

DOI: 10.1007/11767480_7

[10] A. K. Lenstra, J. Lenstra: Algorithms in Number Theory, in: Handbook of Theoretical Computer Science, Volume A, MIT Press/Elsevier, Amsterdam (1990), pp.673-715.

DOI: 10.1016/b978-0-444-88071-0.50017-5

[11] S. Tritilanunt, C. Boyd, E. Foo, et al: Toward Non-parallelizable Client Puzzles, in: Proceedings of Cryptology and Network Security: 6th International Conference, Singapore (2007), pp.247-264.

DOI: 10.1007/978-3-540-76969-9_16

[12] R. C. C. Cheung, A. Brown, W. Luk, et al: A Scalable Hardware Architecture for Prime Number Validation, in: Proceedings of IEEE International Conference on Field-programmable Technology, Queensland, Australia (2004), pp.177-184.

DOI: 10.1109/fpt.2004.1393266

[13] J. Buchmann, V. Muller: Algorithms for Factoring Integers, http: /www. cdc. informatik. tu-darmstadt. de/~buchmann/Lecture%20Notes/Algorithms%20for%20factoring%20integers. pdf.