Affiliation:
1. Chinese Academy of Sciences
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.
Publisher
Trans Tech Publications, Ltd.
Reference13 articles.
1. R. C. Merkle: Secure Communications over Insecure Channels, Communications of the ACM, Vol. 21, No. 4 (1978), pp.294-299.
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.
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.
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.
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.