Proofs to filter spam

Proofs to filter spam

Embodiments of proofs to filter spam are presented herein. Proofs are utilized to indicate a sender used a set amount of computer resources in sending a message in order to demonstrate the sender is not a "spammer". Varying the complexity of the proofs, or the level of resources used to se...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hulten, Geoffrey J, Seshadrinathan, Gopalakrishnan, Goodman, Joshua T, Mishra, Manav, Pengelly, Robert C J, Rounthwaite, Robert L, Colvin, Ryan C
Format: Patent
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Hulten, Geoffrey J
Seshadrinathan, Gopalakrishnan
Goodman, Joshua T
Mishra, Manav
Pengelly, Robert C J
Rounthwaite, Robert L
Colvin, Ryan C
description Embodiments of proofs to filter spam are presented herein. Proofs are utilized to indicate a sender used a set amount of computer resources in sending a message in order to demonstrate the sender is not a "spammer". Varying the complexity of the proofs, or the level of resources used to send the message, will indicate to the recipient the relative likelihood the message is spam. Higher resource usage indicates that the message may not be spam, while lower resource usage increases the likelihood a message is spam. Also, if the recipient requires a higher level of proof than received, the receiver may request the sender send additional proof to verify the message is not spam.
format Patent
fullrecord <record><control><sourceid>uspatents_EFH</sourceid><recordid>TN_cdi_uspatents_grants_08065370</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>08065370</sourcerecordid><originalsourceid>FETCH-uspatents_grants_080653703</originalsourceid><addsrcrecordid>eNrjZBANKMrPTytWKMlXSMvMKUktUiguSMzlYWBNS8wpTuWF0twMCm6uIc4euqVA2ZLUvJLi-PSiRBBlYGFgZmpsbmBMhBIATzsh1w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Proofs to filter spam</title><source>USPTO Issued Patents</source><creator>Hulten, Geoffrey J ; Seshadrinathan, Gopalakrishnan ; Goodman, Joshua T ; Mishra, Manav ; Pengelly, Robert C J ; Rounthwaite, Robert L ; Colvin, Ryan C</creator><creatorcontrib>Hulten, Geoffrey J ; Seshadrinathan, Gopalakrishnan ; Goodman, Joshua T ; Mishra, Manav ; Pengelly, Robert C J ; Rounthwaite, Robert L ; Colvin, Ryan C ; Microsoft Corporation</creatorcontrib><description>Embodiments of proofs to filter spam are presented herein. Proofs are utilized to indicate a sender used a set amount of computer resources in sending a message in order to demonstrate the sender is not a "spammer". Varying the complexity of the proofs, or the level of resources used to send the message, will indicate to the recipient the relative likelihood the message is spam. Higher resource usage indicates that the message may not be spam, while lower resource usage increases the likelihood a message is spam. Also, if the recipient requires a higher level of proof than received, the receiver may request the sender send additional proof to verify the message is not spam.</description><language>eng</language><creationdate>2011</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/8065370$$EPDF$$P50$$Guspatents$$Hfree_for_read</linktopdf><link.rule.ids>230,308,780,802,885,64039</link.rule.ids><linktorsrc>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/8065370$$EView_record_in_USPTO$$FView_record_in_$$GUSPTO$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Hulten, Geoffrey J</creatorcontrib><creatorcontrib>Seshadrinathan, Gopalakrishnan</creatorcontrib><creatorcontrib>Goodman, Joshua T</creatorcontrib><creatorcontrib>Mishra, Manav</creatorcontrib><creatorcontrib>Pengelly, Robert C J</creatorcontrib><creatorcontrib>Rounthwaite, Robert L</creatorcontrib><creatorcontrib>Colvin, Ryan C</creatorcontrib><creatorcontrib>Microsoft Corporation</creatorcontrib><title>Proofs to filter spam</title><description>Embodiments of proofs to filter spam are presented herein. Proofs are utilized to indicate a sender used a set amount of computer resources in sending a message in order to demonstrate the sender is not a "spammer". Varying the complexity of the proofs, or the level of resources used to send the message, will indicate to the recipient the relative likelihood the message is spam. Higher resource usage indicates that the message may not be spam, while lower resource usage increases the likelihood a message is spam. Also, if the recipient requires a higher level of proof than received, the receiver may request the sender send additional proof to verify the message is not spam.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2011</creationdate><recordtype>patent</recordtype><sourceid>EFH</sourceid><recordid>eNrjZBANKMrPTytWKMlXSMvMKUktUiguSMzlYWBNS8wpTuWF0twMCm6uIc4euqVA2ZLUvJLi-PSiRBBlYGFgZmpsbmBMhBIATzsh1w</recordid><startdate>20111122</startdate><enddate>20111122</enddate><creator>Hulten, Geoffrey J</creator><creator>Seshadrinathan, Gopalakrishnan</creator><creator>Goodman, Joshua T</creator><creator>Mishra, Manav</creator><creator>Pengelly, Robert C J</creator><creator>Rounthwaite, Robert L</creator><creator>Colvin, Ryan C</creator><scope>EFH</scope></search><sort><creationdate>20111122</creationdate><title>Proofs to filter spam</title><author>Hulten, Geoffrey J ; Seshadrinathan, Gopalakrishnan ; Goodman, Joshua T ; Mishra, Manav ; Pengelly, Robert C J ; Rounthwaite, Robert L ; Colvin, Ryan C</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-uspatents_grants_080653703</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2011</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Hulten, Geoffrey J</creatorcontrib><creatorcontrib>Seshadrinathan, Gopalakrishnan</creatorcontrib><creatorcontrib>Goodman, Joshua T</creatorcontrib><creatorcontrib>Mishra, Manav</creatorcontrib><creatorcontrib>Pengelly, Robert C J</creatorcontrib><creatorcontrib>Rounthwaite, Robert L</creatorcontrib><creatorcontrib>Colvin, Ryan C</creatorcontrib><creatorcontrib>Microsoft Corporation</creatorcontrib><collection>USPTO Issued Patents</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hulten, Geoffrey J</au><au>Seshadrinathan, Gopalakrishnan</au><au>Goodman, Joshua T</au><au>Mishra, Manav</au><au>Pengelly, Robert C J</au><au>Rounthwaite, Robert L</au><au>Colvin, Ryan C</au><aucorp>Microsoft Corporation</aucorp><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Proofs to filter spam</title><date>2011-11-22</date><risdate>2011</risdate><abstract>Embodiments of proofs to filter spam are presented herein. Proofs are utilized to indicate a sender used a set amount of computer resources in sending a message in order to demonstrate the sender is not a "spammer". Varying the complexity of the proofs, or the level of resources used to send the message, will indicate to the recipient the relative likelihood the message is spam. Higher resource usage indicates that the message may not be spam, while lower resource usage increases the likelihood a message is spam. Also, if the recipient requires a higher level of proof than received, the receiver may request the sender send additional proof to verify the message is not spam.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_uspatents_grants_08065370
source USPTO Issued Patents
title Proofs to filter spam
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T05%3A26%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-uspatents_EFH&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Hulten,%20Geoffrey%20J&rft.aucorp=Microsoft%20Corporation&rft.date=2011-11-22&rft_id=info:doi/&rft_dat=%3Cuspatents_EFH%3E08065370%3C/uspatents_EFH%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true