Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/6610
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGupta, R.-
dc.contributor.authorVinay, Kumar, K.-
dc.contributor.authorMohandas, R.-
dc.date.accessioned2020-03-30T09:45:54Z-
dc.date.available2020-03-30T09:45:54Z-
dc.date.issued2011-
dc.identifier.citationCommunications in Computer and Information Science, 2011, Vol.157 CCIS, , pp.233-239en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/6610-
dc.description.abstractExisting solutions for spam control that are limited to spam filtering at the receiver side underestimate the fact that the network bandwidth and processing time of the recipient email servers are wasted. To cut down these costs spam should be controlled before it reaches the receiving email server. In this paper, we propose a solution to control spam at the senders email server by throttling the client's CPU using integer factorization problem. Integer factorization is used to generate stamps as a proof of CPU cycles expended by the senders system for each email recipient. Cost of generating stamps is negligible when the client is sending emails to only a few recipients. However, as the number of recipients increases, the cost of generating stamps also increases which adversely affects the processing speed of the client. The server requires minimal processing time to verify stamps generated by the client. � Springer-Verlag 2011.en_US
dc.titleSpam control by source throttling using integer factorizationen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
6610.pdf129.5 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.